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
- 1429 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 |
Why do we use data structures?
What are binary trees?
Explain what are the major data structures used in the rdbms?
Differentiate between hashset and treeset.
What are the advantages of linked list?
What is binary search tree and explain its time complexity?
What is space complexity of a program?
What happens if we put duplicate key in hashmap?
What is the use of prototype?
What are the advantage of collection classes over arrays?
Is a hashset ordered?
Define a linear and non linear data structure.
Windows 
