What Is A Minimum Spanning Tree?

1.	What Is A Minimum Spanning Tree?
Answer» 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. 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.

Answer»

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.

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.

Discussion