top button
Flag Notify
    Connect to us
      Site Registration

Site Registration

Does the minimum spanning tree of a graph give the shortest distance between any two specified nodes?

+6 votes
1,105 views
Does the minimum spanning tree of a graph give the shortest distance between any two specified nodes?
posted Oct 29, 2013 by Mona Sharma

Share this question
Facebook Share Button Twitter Share Button LinkedIn Share Button

1 Answer

+1 vote

No.
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.

answer Oct 29, 2013 by Vikas Upadhyay
Similar Questions
0 votes
Given a graph, find the number of shortest paths present between source and destination?

Given a graph and a source node and destination node, find the number of shortest paths present between source and destination?

+2 votes
Given a string and two words which are present in the string, find the minimum distance between the words

Given a string and two words which are present in the string, find the minimum distance between the words

Example:
"the brown quick frog quick the", "the" "quick"
Min Distance: 1

"the quick the brown quick brown the frog", "the" "brown"
Min Distance: 2

C/Java code would be helpful?

...