learngraphtheory.org

Interactive Graph Theory Learning

Guest User

Using app without sign in

Cover of the book Optimization in Python

New book

Optimization in Python

PuLP, OR-Tools and Pyomo by Example

By Mohammed Islam Hadjoudj

Turn real business decisions into optimization models and solve them in Python with free, open-source tools.

Available inKindlePaperback

412 pages

Learning Path

Master graph theory through interactive lessons

0 of 8 completed0%

Minimum Spanning Trees

Intermediate
Key Concepts:
MSTPrim's AlgorithmKruskal's Algorithm+3 more
Ready to learn?

Click to open the full interactive lesson experience.

Minimum Spanning Trees

Learn about minimum spanning trees and the algorithms to find them: Prim's, Kruskal's, and Borůvka's algorithms.

30 minutes
Intermediate
0/10 sections
MSTPrim's AlgorithmKruskal's AlgorithmBorůvka's AlgorithmUnion-FindGreedy Algorithms

Minimum Spanning Trees (MST)

Abstract

Minimum Spanning Trees represent a fundamental concept in graph theory with extensive applications in network design, clustering, and optimization problems. This comprehensive guide explores the theoretical foundations, classic algorithms, properties, and modern applications of MSTs across various domains.

Cover of the book Optimization in Python

New book

Optimization in Python

PuLP, OR-Tools and Pyomo by Example

By Mohammed Islam Hadjoudj

Turn real business decisions into optimization models and solve them in Python with free, open-source tools.

  • Every chapter goes from a business story to tested code
  • Routing, scheduling, facility location, finance and more
  • Free solvers only: HiGHS, CBC, SCIP and CP-⁠SAT
Available inKindlePaperback

412 pages

Section 1 of 10