Documentation

Convert a bidirected Graph to a Prufer sequence. The graph must be a connected tree or empty. O(n).

Convert a Tree to a Prufer sequence. The tree must be rooted at r. O(n).

Convert a Prufer sequence to a list of edges, each edge present twice in its two orientations. The sequence must be valid. O(n).

Convert a Prufer sequence to a bidirected Graph. The sequence must be valid. O(n).