Computer Science, asked by Anonymous, 2 months ago

what is minimum spanning tree in design and analysis of algorithm​

Answers

Answered by pandesara1475
1

Answer:

A Minimum Spanning Tree (MST) is a subset of edges of a connected weighted undirected graph that connects all the vertices together with the minimum possible total edge weight. To derive an MST, Prim's algorithm or Kruskal's algorithm can be used.

Answered by partoaling
1

Answer:

because it spinning design algorithm for analysis

Explanation:

right answer

Previous Question
Next Question
Similar questions
English, 1 month ago
He was too eager to watch him on T.V. ( Remove adverb ‘too’)​...
Math, 1 month ago
Find the product of -3,-12 and 11​...
History, 1 month ago
Name the Continents the Roman Empire covered?​
Social Sciences, 2 months ago
Can human nature ever be changed? If so, how should it be changed and why? pls answer I have given 50 points pls answer​...
Music, 2 months ago
II. Match the following:- A B 4. Backspace a) to give space between wo 5. Spacebar b) to exit 6. Extra keys c) to delete letters 7. Numeric keys d) Print key 8. Escape key e) Type numbers​...
English, 10 months ago
Mini character in kabuliwala 100word...
Environmental Sciences, 10 months ago
Height of the screen door between urinal should be 1500. True or false?
English, 10 months ago
What specifically according to the poet is transient in life...