1. Pastel
  2. PastelSys
  3. Algorithms
  4. Graph algorithms
  5. Graph traversal

Graph traversal

Back to Graph algorithms

A graph-traversal algorithm visits (exactly once) all those vertices of a graph which are reachable from a given set of seed vertices . The order in which the vertices are visited depends on the specific algorithm.

Algorithm objects

A specific graph traversal algorithm is encapsulated by an algorithm-object implementing the GraphTraversal concept. An algorithm-object of this type can be executed by the traverseGraph() function implemented in generic_traversal.h.

Learn more

  1. Breadth-first traversal
  2. Depth-first traversal

Files

A function for executing graph-traversal algorithm-objects.

An aggregate file for graph traversal

Concepts for graph traversal