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
- 1446 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 |
Data structure used to implement a menu
What is a pass in bubble sort?
Differentiate between singly and doubly linked lists?
What is a vector element?
What does simulation of queues mean?
How many types of sorting algorithms are there?
Which is better merge or quick sort?
Explain the principle of quicksort. What is its complexity?
What are the best data structure courses for gate preparation?
Why we need cursor implementation of linked lists?
what is mean by d-queue?
How do you find the index of an element in an arraylist?
Windows 
