Computer Science, asked by roshanbirudu123, 9 months ago

spanning tree algorithm​

Answers

Answered by Anonymous
2

Answer:

A minimum spanning tree 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. That is, it is a spanning tree whose sum of edge weights is as small as possible.

hope it helps ⬆️✔☺

Similar questions