Expand description
Special algorithms that are difficult to categorize.
Functions
Count spanning trees oriented to
root
.Check whether the sequence of numbers is graph-like.
Laplacian (Kirchhoff) matrix of a graph.
Generate the prufer code
for a given tree.
Restore a tree by its prufer code.