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
- 1376 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 b tree in data structure?
What is a Breadth First Search? Give a few of its applications.
Which is the fastest sorting?
What is collection sort?
If you have to store one lakh objects, what will be a better option- a hash map or an array list?
What are the tasks performed during postorder traversal?
What is impact of signed numbers on the memory using data structures?
What is bitonic search?
Which data structure is applied when dealing with a recursive function?
How remove all from arraylist?
Tell me the difference between the character array and a string.
What is a vector class?
What is meant by a dynamic array?
Can hashset contain duplicates?
What is dynamic array how is it created?
