Content deleted Content added
m Add link to the Online Algorithm page within the Graph Exploration section to improve clarity of definition. |
No edit summary Tag: Reverted |
||
Line 4:
In [[computer science]], '''graph traversal''' (also known as '''graph search''') refers to the process of visiting (checking and/or updating) each vertex in a [[Graph (discrete mathematics)|graph]]. Such traversals are classified by the order in which the vertices are visited. [[Tree traversal]] is a special case of graph traversal.
Post order traversal is a bit silly because you have to go backwards.
==Redundancy==
| |||