Graphs/Traversal: Difference between revisions
From charlesreid1
No edit summary |
No edit summary |
||
| Line 21: | Line 21: | ||
==Flags== | |||
{{GraphsFlag}} | {{GraphsFlag}} | ||
Revision as of 08:48, 5 September 2017
Introduction
Graph traversal is a way of walking through the entire graph, visiting each vertex in the graph once.
There are some similarities with tree traversal, but graph traversal is basically a more general version of tree traversal - trees are DAGs (directed acyclic graphs), so tree traversals are traversals on a DAG.
Related Pages
Related pages on tree traversal:
Related pages on breadth-first search and traversal:
Related pages on
Flags