Sing while you build a tree

If you happen to know about the Perlman algorithm for creating a spanning tree for bridges in Computer Networks, then here you have the algorithm right in Radia Perlman's style.

Algorhyme

I think that I shall never see
A graph more lovely than a tree.

A tree whose crucial property
Is loop-free connectivity.

A tree that must be sure to span
So packets can reach every LAN.

First, the root must be selected.
By ID, it is elected.

Least-cost paths from root are traced.
In the tree, these paths are placed.

A mesh is made by folks like me,
Then bridges find a spanning tree.

- Radia Perlman

Hope you enjoyed this poem.... You guys heard any of such ones????