BFS traverses g in breadth-first order starting at v.

BFSAll travel in-degree, out-degree and all out-edges BFSAll will call do function for all out edges TODO: move away, this is not a standard BFS function.

BFSBoth travel both in-degree and out-degree.

Check collects data about an Iterator.

New constructs a new graph with n vertices, numbered from 0 to n-1, and no outEdges.

Sort returns an immutable copy of g with a Visit method that returns its neighbors in increasing numerical order.

String returns a description of g with two elements: the number of vertices, followed by a sorted list of all edges.

Transpose returns the transpose graph of g.

The maximum and minum value of an edge cost.

The maximum and minum value of an edge cost.

Immutable is a compact representation of an immutable graph.

Mutable represents a directed graph with a fixed number of vertices and weighted outEdges that can be added or removed.

Stats holds basic data about an Iterator.

Iterator is a non-weighted graph; an Iterator can be used to describe both ordinary graphs and multigraphs.