Module petgraph::visit::traversal

source ·

Structs§

  • Bfs
    A breadth first search (BFS) of a graph.
  • Dfs
    Visit nodes of a graph in a depth-first-search (DFS) emitting nodes in preorder (when they are first discovered).
  • DfsPostOrder
    Visit nodes in a depth-first-search (DFS) emitting nodes in postorder (each node after all its descendants have been emitted).
  • Topo
    A topological order traversal for a graph.
  • WalkerIter
    A walker and its context wrapped into an iterator.

Traits§

  • Walker
    A walker is a traversal state, but where part of the traversal information is supplied manually to each next call.