Names of Graph Traversal Algorithms

dreadwail picture dreadwail · Jul 2, 2009 · Viewed 11.5k times · Source

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.