Saturday, May 09, 2015

Algorhyme

I think that I shall never seea graph more lovely than a tree.
A tree whose crucial propertyis loop-free connectivity.
A tree that must be sure to spanso 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.



from lizard's ghost http://ift.tt/1KSxO8u

No comments:

Post a comment