okay,

the problem is in the dfs and dfs_visit_node functions. i want to do a depth first traversal of the adjacency list i wrote. The problem in the dfs functions is that i doesn't print anything. its not working. the program compiles and runs but without with the traversed nodes in depth first search order.



gbilios