What is a spanning tree?does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
- 1 Answers
- 976 Views
- I also Faced
- E-Mail Answers
Answer / Hridesh Kumar
A spanning tree is a subset of a connected graph that contains all its vertices but no cycles. A minimum spanning tree (MST) is a spanning tree with the minimum possible total edge weight. Yes, the MST of a graph does give the shortest path between any two nodes, as it is constructed by finding and adding edges with the smallest weights until a tree is formed.
| Is This Answer Correct ? | 0 Yes | 0 No |
What is the difference between hashset and arraylist?
Given M x N matrix with sorted elements row wise and column wise, find elements?
How is it possible to insert different type of elements in stack?
What is default size of hashmap?
What is dynamic array how it is created?
Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
Which is the simplest file structure?
Does linkedhashset allow null values?
how a polynomial such as 6x^6+4x^3-2x+10 can be represnted by linked list?write an algorithm that reads such an polynomial
How do you initialize an arraylist?
What do you mean by sorting data?
How is any data structure application is classified among files?
Windows 
