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
- 1362 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 |
What is time complexity of quick sort?
How do you assign an address to an element of a pointer array ?
Write a recursive c function to calculate the height of a binary tree.
How do I rearrange rows in numbers?
What is the default value of Array?
What do you mean by the term “percolate up”?
Define probing?
Write the advantage of separate chaining?
what is a complexity of linear search,binery search?
What is time complexity of arrays sort?
Devise a program to sort an array using bubble sort.
How to initialize Dictionary using collection initialize?
Windows 
