A tree is a connected graph with no cycles. A
spanning tree is a subgraph which includes all the vertices of a graph
and is also a tree. A minimum spanning tree (or minimum connector) is a
spanning tree such that the total length of its edges is as small as possible.
Note: The number of edges in the minimum spanning tree is one less than the
number of vertices. |
