Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
- 1 Answers
- 1073 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 |
Define the term “percolate up”?
What are skew trees? For a tree with 4 nodes draw all possible binary? Generalize for n nodes how many binary trees can be drawn?
Can array store heterogeneous data?
Which interfaces are implemented by printerstatereasons?
What is a static structure?
Can a tree be empty?
What do you mean by the term “percolate down”?
What are the properties of binary heap?
What method is used to place a value onto the top of a stack?
How to print element of Array?
Why we use linked list?
Are sets sorted?
Windows 
