Interested to Buy Any Domain ? << Click Here >> for more details...
Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
- 1 Answers
- 1507 Views
- I also Faced
- E-Mail Answers
Answer / sandeep vimal
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.
| Is This Answer Correct ? | 0 Yes | 0 No |
Can a hashmap have duplicate keys?
What is complexity of quicksort?
Does treeset allow null?
What is huffman’s algorithm?
How do you increase the capacity of an arraylist?
What is integer max_value?
Can we add elements to final list?
Define right-in threaded tree?
What do you mean by 2-3 tree?
what are the applications of Linked Lists?
Explain linear linked implementation of Stack and Queue?
State the rules to be followed during infix to prefix conversions?
Windows 
