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
- 1348 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 are linked lists most commonly used for?
What is a concurrenthashmap?
What is the relationship between a queue and its underlying array?
What is the purpose of sorting algorithms?
Which algorithm is used in arrays sort?
What is map data structure?
What is difference between hashset and treeset?
Can you please explain the difference between array_name and &array_name?
Do you know how to find if linked list has loop?
Why linked list is required?
How do you solve a selection sort?
Tell me the difference between structure and array?
Windows 
