Computer Science, asked by bizzaakhil, 7 months ago

minimum spanning tree​

Answers

Answered by seharfatima3333
0

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. ... There are quite a few use cases for minimum spanning trees.

Similar questions