BronKerbosch returns the set of maximal cliques of the undirected graph g.

ConnectedComponents returns the connected components of the undirected graph g.

CyclesIn returns the set of elementary cycles in the graph g.

IsPathIn returns whether path is a path in g.

PathExistsIn returns whether there is a path in g starting at from extending to to.

Sort performs a topological sort of the directed graph g returning the 'from' to 'to' sort order.

SortStabilized performs a topological sort of the directed graph g returning the 'from' to 'to' sort order, or the order defined by the in place order sort function where there is no unambiguous topological ordering.

TarjanSCC returns the strongly connected components of the graph g using Tarjan's algorithm.

VertexOrdering returns the vertex ordering and the k-cores of the undirected graph g.

Unorderable is an error containing sets of unorderable graph.Nodes.