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
- 1359 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 |
Can arraylist contain duplicates?
Provide an algorithm to reverse a linked list without using recursion.
Let the G be a graph with 100 vertices numbered 1 to 100 Two vertices i and j are adjecnt if | i-j| =8 or | i-j| =12. The Number of connected components in G is ?
What is the default capacity of hashmap?
What is the default size of an arraylist?
Can we change the size of an array at run time?
What does abstract data type mean?
Is hashset synchronized?
Does treemap sort on key or value?
Explain stacks and queues in detail.
Write a program for reversing the Single Linked List?
Name few concurrent collection classes?
Windows 
