Thinkycap logo
Worksheets

Minimum Spanning Trees

Master of Science in Computer Science · University · Advanced Data Structures

This unit introduces the concept of minimum spanning trees and covers two widely used algorithms for finding them: Kruskal's algorithm and Prim's algorithm. Students will learn how to apply these algorithms to solve real-world problems.

Coming soonPractice questions for this topic are coming soonUntil then, you can already practice other topics.Browse topics

What's included

  • Definition and properties of minimum spanning trees
  • Kruskal's algorithm
  • Prim's algorithm
  • Applications of minimum spanning trees
  • Comparison of Kruskal's and Prim's algorithms

Keywords

  • Minimum Spanning Trees
  • Kruskal's Algorithm
  • Prim's Algorithm
  • Graph Algorithms
  • Applications