Computer Science, asked by Anonymous, 1 month 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

Similar questions