Ord a => [a] -> [a] +fgl
applies lookup to an interval
depth-first search yielding number of nodes
List N available Nodes, i.e. Nodes that are not used in the Graph.
Find the neighbors for a Node.
Find all Nodes that link to to the given Node.
Find all Nodes that have a link from the given Node.
Fold a function over the graph.
The inward-bound degree of the Node.
The outward-bound degree of the Node.
Compute the value of a maximumflow