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
- 1344 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 |
For addition and deletion. Which one is most preferred: array list or linked list?
Differentiate null and void?
Run time memory allocation is known as in data structure?
Does treeset remove duplicates?
Why is hashset used?
Is null a binary search tree?
What is the complexity of sorting algorithm?
What is difference between capacity and size of arraylist?
How to excel in data structures and algorithms?
Explain binary searching, Fibinocci search.
How can you implement a stack?
If we try to add duplicate key to the hashmap, what will happen?
Windows 
