What is a minimum spanning tree?

A minimum spanning tree of an undirected graph G is a tree formed from graph edges that connects all the vertices of G at the lowest total cost.

Sanisha Maharjan
Jan 23, 2022
More related questions

Questions Bank

View all Questions

Top