Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
- 1 Answers
- 819 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 |
How is it possible to insert different type of elements in stack?
Can treemap have duplicate values?
Write is a binary search tree? Write an algorithm and tell complexity?
0 Answers ITC Indian Tobacco Company,
How to cut or remove an element from the array?
Which interfaces are implemented by enumset?
Which is faster list or set?
Why do we use insertion sort?
What are the operations that can be performed on a stack?
What is the difference between dictionary and hashtable?
How do you empty an arraylist?
How can you implement a stack?
Does array sort mutate?
Windows 
