Any spanning tree algorithm
can be used to determine the spanning tree on the mobile graph.
The LET-DG algorithm is a distributed implementation of the maximum spanning tree algorithm
 on a weighted network graph with the edge weights modeled as the predicted link expiration time (LET) of the constituent end nodes.
The run-time complexity of the rd-MST algorithm is O([absolute value of E] x log [[absolute value of E]) + O([absolute value of V] + [absolute value of E]) = O([absolute value of V] + [absolute value of E] x log [absolute value of E]), where O([absolute value of E] x log [absolute value of E]) is the run-time complexity of the Kruskal's minimum-weight spanning tree algorithm
 and O([absolute value of V] + [absolute value of E]) is the run-time complexity of Breadth- First Search , both on a graph of [absolute value of V] vertices and [absolute value of E] edges.
In addition, we also illustrate that the Prim's minimum spanning tree algorithm
and its modification to compute the maximum spanning tree can be respectively used to determine the 'All Pairs Smallest Bottleneck Paths' and 'All Pairs Largest Bottleneck Paths' in a weighted network graph.
1d standard Spanning Tree algorithm
support allows maximization of bandwidth and increased network efficiency through protection against path redundancy.
To ensure reliability in the wiring closet, each module is hot-swappable and supports the spanning tree algorithm
on physical and VLAN connections.
Source address filtering, destination address filtering and the spanning tree algorithm
are supported by the module.
The Auto Single Route feature eliminates broadcast frames for source route bridging while Spanning Tree Algorithm
support allows for wire speed transparent bridging.
1d Spanning Tree Algorithm
- identifies redundant paths between spanning tree bridges to eliminate endless loops and designates one path as the primary path and assigns another as the secondary path to be activated in event of primary path failure.
It supports IP and IPX routing and uses the spanning tree algorithm
to provide bridging.
The Compatible Systems bridging additions support the IEEE Spanning Tree algorithm
, which prevents bridging loops.
1d Spanning Tree algorithm
designed to increased network redundancy and decrease the incidence of broadcast storms, and elastic buffering to accommodate dissimilar line rates or network availability.