Graphs/Traversal

From charlesreid1

Revision as of 08:48, 5 September 2017 by Admin (talk | contribs)

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:

  • BFS - breadth first search
  • BFT - breadth first traversal

Related pages on

  • DFS - depth first search
  • DFT - depth first traversal



Flags



GraphFlag.png
Graphs
notes on graph theory, graph implementations, and graph algorithms

Part of Computer Science Notes

Series on Data Structures


Graphs


Graph Theory:

Graphs/Definitions  · Graphs/Matching  · Graphs/Connectivity

First Theorem of Graph Theory


Graph Implementations:

Graphs/Data Structures  · Graphs/ADT

Graphs/Java/Adjacency Map  · Graphs/Java/Adjacency Map Lite

Graphs/Guava


Graph Algorithms:

Algorithms/Graphs


Traversal:

Graphs/Traversal  · Graphs/Euler Tour  · Graphs/Depth First Traversal  · Graphs/Breadth First Traversal

Category:Traversal


Connectivity and Cycles:

Graphs/Finding Cycles  · Graphs/Finding Connected Components  · Graphs/Reachability


Transitive Closure:

Graphs/Transitive Closure  · Graphs/Floyd Warshall Algorithm


Shortest Path:

Graphs/Shortest Path  · Graphs/Edge Relaxation  · Graphs/Dijkstra


Minimum Spanning Tree:

Graphs/Minimum Spanning Tree  · Graphs/Prim Jarnik Algorithm  · Graphs/Kruskal Algorithm

Graphs/Cluster Finding


Directed Acyclic Graphs:

DAGs  · Graphs/Cycles  · Graphs/Topological Sort


Category:Graphs  · Category:Algorithms  · Category:CS  · Category:Data Structures


Flags  · Template:GraphsFlagBase  · e



Retrieved from "https://charlesreid1.com/w/index.php?title=Graphs/Traversal&oldid=20881"