Structs§

  • This TriColorVisitor looks for back edges in a graph, which indicate that a cycle exists.
  • A “depth-first search” iterator for a directed graph.
  • Event 🔒
  • A depth-first search that also tracks when all successors of a node have been examined.

Enums§

  • The status of a node in the depth-first search.

Traits§

  • What to do when a node is examined or becomes Settled during DFS.

Functions§