midGraph Theory
Kruskal's Algorithm for MST
Updated Apr 28, 2026
Short answer
A greedy algorithm that builds a Minimum Spanning Tree by sorting all edges and adding them if they don't form a cycle.
Deep explanation
Mid-level Graph theory focuses on classic pathfinding and optimization algorithms. A greedy algorithm that builds a Minimum Spanning Tree by sorting all edges and adding them if they don't form a cycle.
Real-world example
Google Maps finding the fastest route to a destination.
Common mistakes
- Using Dijkstra on a graph with negative edge weights.
Follow-up questions
- Time complexity of Dijkstra?