No. The Minimal spanning tree assures that the total weight of the tree is kept at its minimum. But it doesn't mean that the distance between any two nodes involved in the minimum-spanning tree is minimum.
Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
Message [Page 1 of 1]
1 Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes? Thu Dec 04, 2014 5:01 pm
Digital Marketing
Admin
Message [Page 1 of 1]
Digital Marketing » Your first category » Your first forum » Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
Similar topics
» What is a spanning Tree?
» Minimum number of queues needed to implement the priority queue?
» In an AVL tree, at what condition the balancing is to be done?
» Explain covariance and contra-variance in .NET Framework 4.0. Give an example for each.
» List out few of the Application of tree data-structure?
» Minimum number of queues needed to implement the priority queue?
» In an AVL tree, at what condition the balancing is to be done?
» Explain covariance and contra-variance in .NET Framework 4.0. Give an example for each.
» List out few of the Application of tree data-structure?
Permissions in this forum:
You cannot reply to topics in this forum