Definition
Minimal Spanning Tree
Let
be a finite undirected connected graph with edge-weight function . A minimal spanning tree of is a spanning tree whose total weight is smallest among all spanning trees of
: The word minimal refers to this total weight, not to inclusion of the edge set. Equal edge weights can give
several minimal spanning trees.