Graphs/Traversal: Difference between revisions
From charlesreid1
(Created page with "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. Also see: * Trees/Pr...") |
No edit summary |
||
| Line 1: | Line 1: | ||
==Introduction== | |||
Graph traversal is a way of walking through the entire graph, visiting each vertex in the graph once. | 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. | 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: | |||
* [[Trees/Preorder]] | * [[Trees/Preorder]] | ||
* [[Trees/Postorder]] | * [[Trees/Postorder]] | ||
* [[Trees/Inorder]] | * [[Trees/Inorder]] | ||
Related pages on breadth-first search and traversal: | |||
* [[BFS]] - breadth first search | |||
* [[BFT]] - breadth first traversal | |||
Related pages on | |||
* [[DFS]] - depth first search | |||
* [[DFT]] - depth first traversal | |||
Revision as of 08:46, 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