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
- 1503 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 |
Give one example of right rotation.
What is a B tree?
0 Answers Akamai Technologies,
Define threaded binary tree. Explain its common uses
How does quick sort work?
What does the dummy header in the linked list contain?
Which sorting algorithm has minimum number of swaps?
How does a hashtable work?
Why do we need sorting?
What is the difference between collections class vs collections interface?
Explain the priority queue?
What are different methods of collision resolution in hashing.
List out the basic operations that can be performed on a stack?
Windows 
