bn:03155651n
Noun Concept
Categories: Spanning tree, Articles with short description, Polynomial-time problems, All Wikipedia articles written in American English
EN
minimum spanning tree  Algorithms for finding minimum spanning trees  Applications of minimum spanning trees  Applications of the minimum spanning tree problem  Min spanning tree
EN
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. Wikipedia
Definitions
Relations
Sources