References

summary
public	F adj(edges: Iterable): Map Constructs the adjacency list for an undirected unweighted connected loopless multigraph G given as a list of edges.
public	F * outgoingedges(G: Map, U: Set): Iterable Yields all edges of an undirected unweighted connected loopless multigraph G that have one endpoint inside some vertex subset U and that have the other endpoint inside of V = V(G) \ U.

maxback

summary
private	F _contract(G: Map, ordering: Array): Map Given G and some ordering, computes the graph H obtained from G by contracting all edges between the last two vertices of the ordering.
private	F * _order(G: Map): Iterable Lists the vertices of an undirected unweighted connected loopless multigraph G in max-back order.
private	F * _smallcuts(G: Map): Iterable Yields the small cuts of undirected unweighted connected loopless multigraph G.
public	F maxback(edges: Iterable): Iterable Convenience wrapper around Nagamochi-Ibaraki poly-time algorithm.
public	F mb(G: Map): Array Nagamochi-Ibaraki poly-time algorithm.

Directories