Module portgraph::algorithms

Algorithm implementations for portgraphs.

Structs

• DominatorTree
  A dominator tree for a PortGraph.
• PostOrder
  Iterator over a PortGraph in post-order.
• TopoSort
  Iterator over a PortGraph in topological order.

Functions

• dominators
  Returns a dominator tree for a PortGraph, where each node is dominated by its parent.
• dominators_filtered
  Returns a dominator tree for a PortGraph, where each node is dominated by its parent, applying a filter to the nodes and ports.
• postorder
  Returns an iterator doing a post-order traversal of a spanning tree in a PortGraph.
• postorder_filtered
  Returns an iterator doing a post-order traversal of a spanning tree in a PortGraph, applying a filter to the nodes and ports. No filtered nodes are returned, and neither are any nodes only accessible via filtered nodes or filtered ports.
• toposort
  Returns an iterator over a PortGraph in topological order.
• toposort_filtered
  Returns an iterator over a PortGraph in topological order, applying a filter to the nodes and ports. No filtered nodes are returned, and neither are any nodes only accessible via filtered nodes or filtered ports.