Names of Graph Traversal Algorithms

Question

What I'm looking for is a comprehensive list of graph traversal algorithms, with brief descriptions of their purpose, as a jump off point for researching them. So far I'm aware of:

• Dijkstra's - single-source shortest path
• Kruskal's - finds a minimum spanning tree

What are some other well-known ones? Please provide a brief description of each algorithm to each of your answers.

Answer 1

the well knowns are :

• Depth-first search http://en.wikipedia.org/wiki/Depth-first_search
• Breadth-first search http://en.wikipedia.org/wiki/Breadth-first_search
• Prim's algorithm http://en.wikipedia.org/wiki/Prim's_algorithm
• Kruskal's algorithm http://en.wikipedia.org/wiki/Kruskal's_algorithm
• Bellman–Ford algorithm http://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm
• Floyd–Warshall algorithm http://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm
• Reverse-delete algorithm http://en.wikipedia.org/wiki/Reverse-Delete_algorithm
• Dijkstra's_algorithm http://en.wikipedia.org/wiki/Dijkstra's_algorithm

network flow

• Ford–Fulkerson algorithm http://en.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_algorithm
• Maximum Flow http://en.wikipedia.org/wiki/Maximum_flow_problem