#header-inner {background-position: right !important; width: 100% !important;}


Spanning Trees.

Spanning trees are directed, oriented graphs without cycles that connect all nodes.

(article stub, will be clarified, edited and elaborated).

* (need to add more about spanning trees and perhaps algorithms associated with such).
* Spanning tree in 3D is core of multicast/broadcast routing using stitie machine.
* Does it matter at all if tree or graph is in 3D or not? it does not in itself, but starts to when we consider costs and minimum spanning trees in the Internet.
* If we consider stitie cube topology (see also: 'little oranger hell' in gallery to the left side of this blog), then it starts to matter anyway (that it is in 3D).

No comments:

Post a Comment