Algorithms‎ > ‎Graphs‎ > ‎

Elementary Graph

Reachability: visit all the nodes which are reachable from vertex v in G = (V, E).
Depth first search is similar to preorder tree traversal.
Breadh first search is similar to level order tree traversal.
Comments