Graph traversal

From Wikipedia, the free encyclopedia

Graph search algorithms
Search A* B* Bellman-Ford algorithm Best-first search Bidirectional search Breadth-first search Depth-first search Depth-limited search Dijkstra's algorithm Floyd-Warshall algorithm Hill climbing Iterative deepening depth-first search Johnson's algorithm Uniform-cost search

Graph traversal refers to the problem of visiting all the nodes in a graph in a particular manner. Tree traversal is a special case of graph traversal. In contrast to tree traversal, in general graph traversal, each node may have to be visited more than once, and a root-like node that connects to all other nodes might not exist.