title: Names of Graph Traversal Algorithms
body: <p>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:</p>
  
  <ul>
  <li>Dijkstra's - single-source shortest path</li>
  <li>Kruskal's - finds a minimum spanning tree</li>
  </ul>
  
  <p>What are some other well-known ones? Please provide a brief description of each algorithm to each of your answers.</p>