mermaid-live-editor | New implementation | Editor library

Untested pseudo-code because my lunch break is nearly over:

You have a multi-root tree, with one chosen principal root.

1. For each root, create a subgraph consisting of all reachable nodes for that root.

2. Starting with the principal root (root a), compute the distance/shortest path length to the root for all nodes in the corresponding subgraph A.

3. Find all subgraphs that share at least one node with the principal subgraph, and select the subgraph (subgraph B) that has the node (node x) with the smallest distance to the principal root.

4. Compute the distance to the root b for all nodes in subgraph B. Add the distance d(node x, root a). Subtract the distance d(node x, root b).

5. Create the union of subgraph A and B. Repeat steps 3-5 until no roots remain.

6. Subtract the maximum distance & reverse the sign such that principal root has the largest distance/order value.

My pseudocode works (*). I blame user error. ;-)