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
- 1509 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
Describe linear probing with an example.
Who invented quicksort?
what is the difference between singly and doubly linked lists?
Can we remove element from arraylist while iterating?
What are the applications of linked list?
List the two important key points of depth first search?
Does treeset allow null values?
Why is quicksort better than mergesort?
What does the term sorting refer to?
Differentiate between comparable and comparator.
Does set allow null values?
When would you use a tuple?
How can you insert a node in a random location of the linked list?
Define a stack?
Why is treeset sorted?
