THE MINIMAL-SPANNING TECHNIQUE

The Shortest-Route Technique



The Shortest-Route Technique

The answer set about to the negligible spanning tree difficulty is really simpler than the shortest path answer method. In the negligible spanning tree answer set about, we can start at any node in the network. However, the accepted set about is to start with node 1. Beginning at node 1, we choose the nearest node (i.e., the shortest branch) to connect our spanning tree. The shortest agency from node 1 is to node 3, with a extent of 9 (thousand feet). This agency is demonstrated with a hefty line in Figure 1.12. Now ...