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
- 1444 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
What is the difference between static and dynamic data?
Why heap sort is not used?
Is a hash table a map?
Is arraylist a collection?
What is meant by deque?
What is a circular singly linked list?
Why do we use sorting?
How are elements stored in hashset?
How long does it take to master data structures and algorithms?
Does hashmap allow null keys?
What is binary tree in discrete mathematics?
What will you prefer for traversing through a list of elements between singly and doubly linked lists?
Why is sorting necessary?
Explain linear linked implementation of Stack and Queue?
What are the disadvantages of linear list?
