2.4 Minimum Cost Spanning Trees - Video

Key Ideas

  • A tree will consist of one piece and contain no circuits. A spanning tree is a tree that connects all vertices of a graph to each other with no redundancy (e.g., for a communications network.)
  • A minimum-cost spanning tree is most economical. Kruskal’s algorithm produces one quickly. This algorithm adds links together in order of cheapest cost so that no circuits form and so that every vertex belongs to some link added.