Graph Theory: If the graph is undirected (has no arrows), how do you know which way to go to find a walk, etc?
If the graph is undirected (has no arrows), how do you know which way to go to find a walk, path, circuit, cycle, etc...? Does order matter?

Question

Graph Theory: If the graph is undirected (has no arrows), how do you know which way to go to find a walk, etc?
If the graph is undirected (has no arrows), how do you know which way to go to find a walk, path, circuit, cycle, etc...? Does order matter?

anonymous · Answer

Order matters..It is easy to modify depth-first search/breath first search algorithms to not only determine whether there exists a path between two given vertices but to find such a path (if one exists).. http://algs4.cs.princeton.edu/41undirected/ ->this link will help u more

anonymous · Answer

Thank you. Check out my other question if you can. I just want to double check my understanding