DSA Notes
HubAlgorithm vs Data Structure — Key Differences, Definitions, and How They Work TogetherApplications of DSA — How Data Structures and Algorithms Power Real-World SoftwareTime and Space Complexity — A Complete BeginnerWhat is DSA? — A Complete BeginnerWhy Learn DSA? — Career Benefits, Real-World Impact, and Long-Term ValueAsymptotic Analysis — Complete Framework with Recurrence Relations and Master TheoremBest, Average, and Worst Case Analysis — A Practical Guide for Every AlgorithmBig O Notation — Complete Guide with Formal Definition, Rules, and ExamplesBig Omega Notation — Lower Bounds, Best Case, and Formal DefinitionBig Theta (Θ) Notation — Tight Bounds and Exact Growth RatesSpace Complexity — Memory Analysis, Auxiliary Space, and Time-Space TradeoffsTime Complexity Examples — 25 Worked Problems from Basic to AdvancedArray Interview Problems — 15 Classic Problems with Complete SolutionsArray Operations — Every Operation Explained with Code, Complexity, and Edge CasesArray Rotation — Algorithms, Techniques, and Interview ProblemsArray Searching — Linear Search, Binary Search, and Advanced TechniquesArrays — The Complete Introduction to the Most Fundamental Data StructureDynamic Arrays — How Python Lists and ArrayLists Work InternallyMultidimensional Arrays — 2D Arrays, Matrices, and Memory LayoutSliding Window Technique — Complete Guide with 10 Classic ProblemsAnagram Problems — Detection, Grouping, and Sliding Window VariationsPalindrome Problems — Check, Longest, Count, and Expand Around CenterPattern Searching — KMP, Rabin-Karp, and Boyer-Moore AlgorithmsString Interview Problems — 10 Classic Problems with Complete SolutionsString Matching — Longest Common Subsequence, Edit Distance, and Z-AlgorithmString Operations — Complete Reference with Complexity and ImplementationStrings — Complete Introduction to String Data Structure and OperationsCircular Linked List — Structure, Operations, and ApplicationsDoubly Linked List — Complete Implementation with Bidirectional OperationsLinked List Interview Problems — 12 Classic Problems with Complete SolutionsLinked Lists — A Complete Introduction with Memory Model and TypesLinked List Operations — Every Technique with Code and ComplexityReverse Linked List — All Approaches from Basic to AdvancedSingly Linked List — Complete Implementation with All OperationsBalanced Parentheses — Stack-Based Validation with All VariantsInfix, Prefix, and Postfix Expressions — Stack-Based Conversion and EvaluationStack Implementation — Three Complete Implementations with Edge CasesStack Interview Problems — 10 Classic Problems with Complete SolutionsStack — Complete Introduction to LIFO Data StructureStack Using Arrays — Memory Layout, Capacity Management, and PerformanceStack Using Linked List — Implementation, Analysis, and When to Use ItCircular Queue — The Ring Buffer Explained with ImplementationDeque — Double-Ended Queue with Complete Implementation and ApplicationsPriority Queue — Complete Guide from Concept to ImplementationQueue Applications — BFS, Level-Order Traversal, 01-BFS, and MoreQueue Implementation — Array, Linked List, and Two-Stack ApproachesQueue Interview Problems — 10 Classic Problems with Complete SolutionsQueue — Complete Introduction to the FIFO Data StructureAVL Tree - Self-Balancing Binary Search TreeBinary Search Tree (BST)Binary Tree - Structure and OperationsFenwick Tree (Binary Indexed Tree)Red-Black Tree - Another Balanced BSTSegment Tree - Range Query Data StructureTree Interview Problems CollectionTree Data Structure FundamentalsTree Traversals - Inorder, Preorder, Postorder, Level OrderHeap — Complete Introduction to the Priority-Based Tree Data StructureHeap Operations — Complete Reference with Complexity AnalysisHeap Problems — 8 Classic Interview Problems with Complete SolutionsMax Heap — Complete Implementation and ApplicationsMin Heap — Complete Implementation with All OperationsPriority Queue Using Heap — Implementation, Applications, and PatternsBellman-Ford Algorithm — Shortest Path with Negative Weights and Cycle DetectionBFS Algorithm — Breadth-First Search with All Applications and VariantsDFS Algorithm — Depth-First Search with Cycle Detection and All ApplicationsDijkstraFloyd-Warshall Algorithm — All-Pairs Shortest Paths with Complete AnalysisGraph Interview Problems — 12 Classic Problems with Complete SolutionsGraph — Complete Introduction to the Most Powerful Data StructureGraph Representation — Adjacency List, Matrix, Edge List with Complete AnalysisKruskalMinimum Spanning Tree — Definition, Properties, and ApplicationsPrimShortest Path Algorithms — Complete Comparison and Selection GuideTopological Sorting — DFS and BFS (KahnUnion-Find (DSU) in Graphs — Connected Components and Dynamic ConnectivitySeparate Chaining — Complete Implementation and AnalysisCollision Handling — Chaining vs Open Addressing Complete ComparisonHash Functions — Design, Properties, and Common ImplementationsHashing — Complete Introduction to Hash Tables and Hash FunctionsHashing Problems — 10 Classic Interview Problems with Complete SolutionsOpen Addressing — Linear Probing, Quadratic Probing, and Double HashingBubble Sort — Complete Analysis with Optimizations and When to Use ItCounting Sort — O(n+k) Sorting That Breaks the Comparison Lower BoundHeap Sort — Guaranteed O(n log n) with O(1) SpaceInsertion Sort — The O(n) Best Case Sort That Powers PythonMerge Sort — Complete Guide to the Guaranteed O(n log n) Stable SortQuick Sort — The Fastest Practical Sorting Algorithm with Complete AnalysisRadix Sort — O(nk) Digit-by-Digit Sorting for Large Integer RangesSelection Sort — Complete Analysis with Swaps Minimization PropertySorting Algorithm Comparison — The Complete Decision GuideSorting — Complete Introduction to Sorting AlgorithmsBinary Search — Complete Guide with All Variants and Proof of CorrectnessInterpolation Search — O(log log n) Search for Uniformly Distributed DataLinear Search — Complete Guide with All Variants and ApplicationsSearch Algorithm Comparison — Choosing the Right Search for Every SituationSearching Interview Problems — 10 Classic Problems with Complete SolutionsTernary Search — Finding Maximum/Minimum of Unimodal FunctionsBacktracking Introduction — The Recursive Exploration with UndoRecursion Basics — The Complete BeginnerRecursion Problems — 12 Classic Problems from Basic to AdvancedRecursion Tree — Visualizing Recursion for Complexity AnalysisRecursion vs Iteration — When to Use Each and How to ConvertTail Recursion — Definition, Optimization, and Converting to IterationDP Interview Problems — 12 Classic Problems with Pattern Recognition GuideDynamic Programming — Complete Introduction with Properties and Problem IdentificationFibonacci DP — From Exponential to Linear with Memoization and Matrix ExponentiationKnapsack Problem — 0/1, Unbounded, and Fractional with Complete AnalysisLongest Common Subsequence — Complete Guide with DP Table and String VariantsLongest Increasing Subsequence — O(n log n) with Patience SortingMatrix Chain Multiplication — Interval DP with Complete AnalysisMemoization — Top-Down Dynamic Programming with CachingTabulation — Bottom-Up Dynamic Programming with Complete Table BuildingActivity Selection Problem — Greedy Scheduling with Proof of CorrectnessFractional Knapsack — Greedy by Value Density with ProofGreedy Interview Problems — 10 Classic Problems with Complete SolutionsGreedy Algorithms — Complete Introduction with Proof TechniquesHuffman Coding — Optimal Prefix-Free Data CompressionJob Sequencing Problem — Greedy Scheduling with DeadlinesBacktracking — The Complete Guide to Recursive Exploration with UndoBacktracking Problems — 12 Classic Interview Problems with Complete SolutionsN-Queens Problem — Complete Solution with Backtracking and OptimizationRat in a Maze — Backtracking Path Finding with All SolutionsSubset Generation — All Subsets, Combinations, and Partitions with BacktrackingSudoku Solver — Backtracking with Constraint PropagationCodeforces Guide — Complete Strategy to Reach 1800+ RatingCommon CP Techniques — Essential Algorithms Every Competitive Programmer Must KnowContest Strategies — How to Perform Your Best in Competitive Programming ContestsCompetitive Programming — Complete Introduction for BeginnersFast Input/Output — Why I/O Speed Matters and Complete Templates for C++ and PythonLeetCode Guide — Complete Strategy to Crack FAANG InterviewsBit Manipulation — Complete Guide with All Tricks and Interview ProblemsBloom Filter — Space-Efficient Probabilistic Membership TestingComputational Geometry — Points, Lines, Convex Hull, and Geometric AlgorithmsDisjoint Set Union (DSU) — Union-Find with Path Compression and Union by RankRandomized Algorithms — Las Vegas, Monte Carlo, and Probabilistic TechniquesSkip List — The Probabilistic Data Structure that Competes with Balanced BSTsSuffix Array — Construction, LCP Array, and String Search ApplicationsTrie Data Structure — Complete Guide with Implementation and ApplicationsAutocomplete System Using TrieLibrary Management System Using DSARoute Finder Using GraphsMini Search Engine ProjectSocial Network Analysis Using GraphsEssential Coding Patterns for InterviewsDSA Cheatsheet: Quick ReferenceEssential DSA Interview QuestionsFAANG DSA Sheet: Company-Specific Patterns and ProblemsProblem Solving Strategies for Coding InterviewsComplexity CheatsheetImportant Algorithms SummaryBest Practice Platforms for DSARecommended Books for DSA
Master Kruskal
How Kruskal's Works
Kruskal's algorithm builds the MST greedily:
- Sort ALL edges by weight (ascending)
- Process edges in order: add each edge to MST if it doesn't create a cycle
- Stop when MST has V-1 edges
Cycle detection is done efficiently using a Disjoint Set Union (DSU) — two vertices are in the same component if they are already connected in the partial MST.
| Sorted edges | [(D-C,1),(A-D,2),(B-C,3),(A-B,4)] |
| Step 1 | Add D-C (w=1): no cycle. MST={D-C} |
| Step 2 | Add A-D (w=2): no cycle. MST={D-C,A-D} |
| Step 3 | Add B-C (w=3): no cycle. MST={D-C,A-D,B-C} |
| Step 4 | Skip A-B (w=4): A and B already connected (A-D-C-B) |
Kruskal's for Named Vertices
Example
def kruskal_named(vertices, edges):
"""Kruskal's for graphs with string vertex names."""
# Map vertex names to indices
v_to_idx = {v: i for i, v in enumerate(vertices)}
n = len(vertices)
indexed_edges = [(v_to_idx[u], v_to_idx[v], w) for u, v, w in edges]
mst_weight, mst_idx = kruskal(n, indexed_edges)
if mst_weight is None:
return None, None
# Convert back to names
idx_to_v = {i: v for v, i in v_to_idx.items()}
mst_named = [(idx_to_v[u], idx_to_v[v], w) for u, v, w in mst_idx]
return mst_weight, mst_named
vertices = ['A', 'B', 'C', 'D']
edges = [('A','B',4),('A','D',2),('B','C',3),('C','D',1)]
w, mst = kruskal_named(vertices, edges)
print(f"MST: {mst}") # [('C','D',1),('A','D',2),('B','C',3)]
Maximum Spanning Tree
Example
def maximum_spanning_tree(n, edges):
"""Find Maximum Spanning Tree by sorting in DESCENDING order."""
sorted_edges = sorted(edges, key=lambda e: -e[2]) # Descending!
dsu = DSU(n)
mst_edges = []
mst_weight = 0
for u, v, w in sorted_edges:
if dsu.union(u, v):
mst_edges.append((u, v, w))
mst_weight += w
return mst_weight, mst_edges
edges = [(0,1,4),(0,3,2),(1,2,3),(2,3,1)]
weight, mst = maximum_spanning_tree(4, edges)
print(f"Max ST weight: {weight}") # 9 (take 4+3+2=9, not 1)
Time Complexity Analysis
| Sorting edges | O(E log E) |
| find | O(α(V)) amortized per call |
| union | O(α(V)) amortized per call |
| Total DSU | O(E α(V)) ≈ O(E) in practice |
| Total | O(E log E) — dominated by sorting |
| Phase | Time Complexity |
|---|---|
| Sort edges | O(E log E) |
| DSU find/union per edge | O(α(V)) amortized |
| Total | O(E log E) |
| Space | O(V + E) |
α(V) is the inverse Ackermann function — it grows so slowly that for all practical purposes it is a constant (≤ 4 for any realistic input size).
Kruskal's vs Prim's — When to Use Which
Both algorithms produce a correct MST, but they have different strengths depending on graph density.
Kruskal's
- Sort E edges: O(E log E)
- Best for: SPARSE graphs (E ≈ V)
- Easy to implement with edge list
- Naturally handles disconnected components
Prim's
- Extract-min V times: O(V log V + E log V) with binary heap
- Best for: DENSE graphs (E ≈ V²) — use adjacency matrix O(V²)
- Better when graph is stored as adjacency matrix
Rule of thumb: Use Kruskal's when edges are given as a list (sparse graph or when edges are pre-sorted). Use Prim's when working with an adjacency matrix or very dense graph.
Detecting Disconnected Graphs
Kruskal's gracefully handles disconnected graphs — you just won't get a spanning TREE, you'll get a spanning FOREST (one tree per connected component).
Example
def kruskal_forest(n, edges):
"""
Build minimum spanning forest for potentially disconnected graph.
Returns list of (component_id, mst_weight, mst_edges) per component.
"""
sorted_edges = sorted(edges, key=lambda e: e[2])
dsu = DSU(n)
forest_edges = []
for u, v, w in sorted_edges:
if dsu.union(u, v):
forest_edges.append((u, v, w))
# Group edges by component
components = {}
for u, v, w in forest_edges:
root = dsu.find(u)
if root not in components:
components[root] = []
components[root].append((u, v, w))
total_weight = sum(w for _, _, w in forest_edges)
num_components = len(set(dsu.find(i) for i in range(n)))
return total_weight, forest_edges, num_components
# Disconnected graph: 0-1-2 and 3-4 (two components)
edges = [(0,1,1),(1,2,2),(3,4,5)]
weight, forest, comps = kruskal_forest(5, edges)
print(f"Total weight: {weight}, Components: {comps}")
# Total weight: 8, Components: 2
Real-World Applications
1. Network Cable Routing
When laying network cables across offices or cities, Kruskal's finds the minimum cable length to connect all nodes:
Example
offices = ['HQ', 'Branch1', 'Branch2', 'Branch3']
cable_costs = [
('HQ', 'Branch1', 500),
('HQ', 'Branch2', 300),
('HQ', 'Branch3', 700),
('Branch1', 'Branch2', 200),
('Branch2', 'Branch3', 400),
]
w, mst = kruskal_named(offices, cable_costs)
print(f"Minimum cable cost: ${w}") # $900
print(f"Connections: {mst}")
2. Cluster Analysis (Maximum Spanning Tree)
In machine learning, maximum spanning trees are used to find natural clusters in data. Edges represent similarity — you want to keep the highest-similarity connections:
Example
# Higher weight = more similar
similarity_edges = [
(0, 1, 0.9), # Data point 0 and 1 are 90% similar
(1, 2, 0.7),
(2, 3, 0.85),
(0, 3, 0.2),
]
# Use maximum spanning tree to find cluster boundaries
weight, mst = maximum_spanning_tree(4, similarity_edges)
3. Approximation for TSP
The minimum spanning tree provides a 2-approximation for the Travelling Salesman Problem. Start with an MST, perform a DFS traversal, and visit each city once — this tour is at most 2× the optimal TSP solution.
Step-by-Step Trace on a Larger Graph
| Edges | (0,1,4),(0,2,2),(0,3,8),(1,4,5),(2,3,7),(2,4,3),(3,4,6) |
| Sorted | [(0,2,2),(2,4,3),(0,1,4),(1,4,5),(3,4,6),(2,3,7),(0,3,8)] |
| Step 1: Edge (0,2,w=2) | Components: {0,2}, {1}, {3}, {4} → ADD |
| Step 2: Edge (2,4,w=3) | Components: {0,2,4}, {1}, {3} → ADD |
| Step 3: Edge (0,1,w=4) | Components: {0,1,2,4}, {3} → ADD |
| Step 4: Edge (1,4,w=5) | 1 and 4 already connected → SKIP |
| Step 5: Edge (3,4,w=6) | Components: {0,1,2,3,4} — all! → ADD |
Summary
Kruskal's algorithm in three steps:
- Sort all edges by weight: O(E log E)
- Use DSU to greedily add edges that don't create cycles: O(E α(V))
- Stop when V-1 edges are added (spanning tree complete)
Total time: O(E log E) — ideal for sparse graphs.
Key properties:
- Works on disconnected graphs (produces a spanning forest)
- Maximum spanning tree: sort edges in descending order
- The DSU makes cycle detection essentially O(1) amortized per edge
- Greedy correctness is proven by the Cut Property of MSTs
*Next Lesson: Topological Sorting*
Exam Focus
Revise definitions, diagrams, examples, and short-answer points for Kruskal.
Interview Use
Prepare one clear explanation, one practical example, and one common mistake for this Data Structures & Algorithms topic.
Search Terms
data-structures-algorithms, data structures & algorithms, data, structures, algorithms, graphs, kruskals, algorithm
Related Data Structures & Algorithms Topics
Continue learning this concept
GraphsBellman-Ford Algorithm — Shortest Path with Negative Weights and Cycle DetectionMaster Bellman-Ford algorithm completely — why it handles negative weights where Dijkstra fails, the V-1 relaxation rounds, negative cycle detection, SPFA optimization, comparison with Dijkstra, and applications in currency arbitrage and network routing protocols.GraphsBFS Algorithm — Breadth-First Search with All Applications and VariantsMaster Breadth-First Search completely — the level-by-level exploration strategy, complete implementation with queue, BFS tree and shortest path guarantee, detecting bipartite graphs, multi-source BFS, 0-1 BFS, BFS on grids, and all classic BFS interview problems.GraphsDFS Algorithm — Depth-First Search with Cycle Detection and All ApplicationsMaster Depth-First Search completely — recursive and iterative implementations, DFS tree and timestamps, cycle detection in directed and undirected graphs, finding articulation points and bridges, DFS on grids, topological sort foundation, and all classic DFS interview problems.GraphsDijkstraMaster DijkstraGraphsFloyd-Warshall Algorithm — All-Pairs Shortest Paths with Complete AnalysisMaster Floyd-Warshall algorithm completely — the all-pairs shortest path approach, the DP recurrence, step-by-step table filling, path reconstruction, negative cycle detection, transitive closure, and comparison with running Dijkstra V times.GraphsPrimMaster Prim