applies lookup to an interval

depth-first search yielding number of nodes

Find the neighbors for a Node.

Fold a function over the graph.

The degree of the Node.

The inward-bound degree of the Node.

The outward-bound degree of the Node.

graph fold

Compute the value of a maximumflow