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
- 1418 Views
- I also Faced
- E-Mail Answers
Answer Posted / 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 |
Post New Answer View All Answers
Why is tuple immutable?
Can hashmap have same key?
List out the disadvantages of using a linked list?
Can we put null key in hashmap?
What is difference between hashmap and map?
Which is the parent class of linkedlist class?
Explain circular linked list?
How will you free the memory that is allocated at run time?
What are the average and worst time complexity in a sorted binary tree is
What is data structure and its classification?
Does linked list allow duplicates?
Can you override methods of arraylist?
Mention some drawbacks of the linked list.
What is a queue in data structure?
Is binary tree a binary search tree?
