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
- 1442 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 |
How do you insert a new item in a binary search tree?
What is hashing technique? Describe in brief.
Which is the parent class of deque<e> class?
Which language is best for learning data structures and algorithms?
What is homogeneous array?
In RDBMS, what is the efficient data structure used in the internal storage representation?
Which sorting algorithm is considered the fastest?
How does arraylist store data?
What does adt stands for?
How treemap orders the elements if the key is a string?
Can you declare an array without assigning the size of an array?
What is a data structure? What are the types of data structures?
Windows 
