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
- 1352 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 doubly linked list?
Write a code for dynamic allocation of array.
Explain what are the major data structures used in the rdbms?
What is sequential sorting?
Explain the applications of stack?
What is difference between hashmap and treemap?
Explain the common uses of tree database.
Which sorting algorithm is used in collections sort?
What happens when arraylist is full?
Write the postfix form of the expression: (a + b) * (c - d)
what is mean by d-queue?
Is array a data structure?
Windows 
