**Packages**- package
- containers
- fgl

A version of the graph algorithms described in:
*Structuring Depth-First Search Algorithms in Haskell*, by David King and John Launchbury.

Static and Dynamic Inductive Graphs

Adjacency list representation of a graph, mapping each vertex to its list of successors.

Simple graphviz output.

Build a graph from a list of nodes uniquely identified by keys, with a list of keys of nodes this node should have edges to. The out-list may contain keys that don't correspond to nodes of the graph; they are ignored.

Identical to graphFromEdges, except that the return value does not include the function which maps keys to vertices. This version of graphFromEdges is for backwards compatibility.

encapsulates a simple recursion schema on graphs

Formats a graph for use in graphviz.