minimum spanning tree
Description: A minimum spanning tree is a connected, cycle-free subgraph linking every vertex of a weighted graph with the lowest possible total edge weight.
Primary topic: Complexity and Algorithms in Graphs (21%)
Related topic: Complexity and Algorithms in Graphs (21%)
Wikidata ID: wiki/Q240464
OpenAlex ID: keywords/minimum-spanning-tree
