Computer Science, asked by flngbst, 4 months ago

explain minimum spanning tree with their applications. also give algorithm to find minimum spanning tree of a weighted graph.​

Answers

Answered by srishti23dz
1

Answer:

A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight

Previous Question
Next Question
Similar questions
Science, 2 months ago
write the signs of a chemical reaction (i) Color Change (ii) A gas given off (iii) Order Of Reactivity​...
Math, 2 months ago
61 x 13 = (60x?) + (? x13)​...
English, 2 months ago
and so on. E. Fill in the blanks using the present perfect tense or past tense of the verbs given in the brackets. 1. (finish) my homework just now. 2. Rita (visit) her grandmother during her summer vacations. 3. Samuel . (already, pack) his bag for the journey. He does not have to miss the movie for packing like us. 4. We (eat) rice today at lunch. So I want to have noodles for dinner. 5.
Math, 4 months ago
This question i need solution plz solve this question plz ans me​...
Math, 4 months ago
Answer this question factories this ​...
Math, 10 months ago
Digit in the one place of the product of 783 and 896...
Math, 10 months ago
Rationalise of denominator 2/√7...
Social Sciences, 10 months ago
GHTAWUAI Rearranged word to make a name of few cities...