DebugString returns a human readable string representation of g.

DFSAll performs a depth first search of all nodes in g.

NewAdjacencyGraph returns a Graph represented using adjacency lists.

OutDegree returns the out-degree for node n in g.

PerEdge calls fn(edge) for every edge in g.

PostOrder returns nodes in g in post-order.

ReversePostOrder returns nodes in g in reverse-post-order.

Edge is a directed graph edge.

Graph is an interface that represents a directed graph.

Node is a small non-negative number that identifies a node in a directed graph.