GeoGebra
GeoGebra
  • Minimal Spanning Tree
      minimal spanning tree
      algorithm of Prim
      algorithm of Kruskal
      exercise 1
      exercise 2
      exercise 3

Minimal Spanning Tree

Author:
chris cambré
A minimum spanning tree (MST)[/b] is a subset of the edges of a connected, edge-weighted (un)directed graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight. That is, it is a spanning tree whose sum of edge weights is as small as possible.

  • minimal spanning tree

  • algorithm of Prim

  • algorithm of Kruskal

  • exercise 1

  • exercise 2

  • exercise 3

Next
minimal spanning tree

New Resources

  • Inequalities on Number line
  • Open Middle Inscribed Angle Exercise (1)
  • Open Middle Arc Length Exercise
  • 榫卯结构
  • Which Segment is Longer? (V2)

Discover Resources

  • Battersea Power Station 1
  • Tangent to ellipse from external point
  • Grade 7 Introduction Final Task
  • Mean of AB and CD
  • ပုံများဆွဲသားခြင်း

Discover Topics

  • Trigonometry
  • Interest Calculation
  • Cosine
  • Addition
  • Sine

GeoGebra

  • About
  • Partners
  • GeoGebra on Tests
  • News Feed
  • App Downloads

Apps

  • Calculator Suite
  • Graphing Calculator
  • 3D Calculator
  • CAS Calculator
  • Scientific Calculator

Resources

  • Classroom Resources
  • Learn GeoGebra
  • Classroom
  • Geometry
  • Notes
  • Terms of Service Privacy License
  • Facebook Twitter YouTube