Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
- 1 Answers
- 807 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 |
What is adt and its advantages?
How do you find the depth of a binary tree?
What do you mean by articulation point?
What method is used to place a value onto the top of a stack?
What is the order of selection sort?
What are different methods of collision resolution in hashing.
What are the major data structures used in the network data model?
Is pointer a variable in data structure?
Which is faster arraylist or linked list?
Does hashmap preserve insertion order?
Where is data structure used?
what are the applications that use Linked lists?
Windows 
