aerial.utils.ds.graphs

Various graph algorithms, techniques, functions.
Generally applicable, but typically used for sequence similarity,
clustering, and path metrics of various sorts.

prufer->tree

(prufer->tree prufer-seq)

tarjan

(tarjan nodes succs)

Returns the strongly connected components of a graph specified by
its nodes and a successor function succs from node to nodes.  The
used algorithm is Tarjan's one.

tree->prufer

(tree->prufer graph)(tree->prufer graph prufer-seq)

Convert a labelled tree to a Prüfer Sequence.