Math 2.0

concept

Minimum spanning tree

Summary

A minimum spanning tree of a weighted connected graph is a spanning tree of least total weight. It is a classical problem of combinatorial optimization, solved by greedy algorithms. The node minimum spanning tree gives the precise definition.

What this node needs for W2
  • edge instance_of in: at least two examples (0 of 2)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Minimum_spanning_tree, lead section

What links here

Definitions