Module graph

Graph utilities.

Functions

• entered_node 🔒
  Add to entered that we have entered node and node has children.
• find_next_child_to_enter 🔒
  Find the next child node, if any, that we have not entered.
• nonrecursive_dft
  A non-recursive implementation of an infallible depth-first traversal starting from root.
• nonrecursive_dft_mut
  Same as nonrecursive_dft, but allows changes to be made to the graph.
• try_nonrecursive_dft
  A non-recursive implementation of a fallible depth-first traversal starting from root.
• try_nonrecursive_dft_mut
  Same as try_nonrecursive_dft, but allows changes to be made to the graph.