All Graph Traversal and Connectivity Algorithms

Algorithms that visit the vertices of a graph or decide how its parts are connected, such as depth-first search, breadth-first search, Tarjan's and Kosaraju's strongly connected components algorithms and topological sorting. An algorithm belongs here when its cited article describes traversing a graph or finding its connected components. It excludes algorithms that weigh routes, which sit in the shortest path group. A member is placed here by what its own cited article states about it, not by the name of the algorithm or by the uses it is put to today, so each entry sits in the group its source describes it as belonging to.