3 ms·
Would have been more fitting to use Algorhyme I think that I shall never see A graph more lovely than a tree. A tree whose crucial property Is loop-
by justinsaccount 6y ago
Would have been more fitting to use
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
- greenyoda 6y agoThe author of this poem is actually the inventor of the Spanning Tree Protocol (which the poem describes): https://en.wikipedia.org/wiki/Radia_Perlman https://en.wikipedia.org/wiki/Radia_Perlman P.S. For those who like nerdy poems, here's a poem which is a proof of the undecidability of the Halting Problem: http://ebiquity.umbc.edu/blogger/2008/01/19/how-dr-suess-would-prove-the-halting-problem-undecidable http://ebiquity.umbc.edu/blogger/2008/01/19/how-dr-suess-wou...
- seattletech 6y agohttps://teachinglondoncomputing.org/poetry/ https://teachinglondoncomputing.org/poetry/