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
- 1345 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 are data and data types?
When would you use a tuple?
Define probing?
What data type is array?
Which algorithm is used in arrays sort?
Write a code for dynamic allocation of array.
How would you check if a binary tree is BST or not ? Write a program.
Define graph traversals?
What are the advantages of linked list?
What are the operations that can be performed on a stack?
Does hashmap allow null keys?
How do you reference all the elements in a one-dimension array?
Why sorting is used?
Tell me the difference between structure and array?
What are scalar values?
