Category: Blog
-
How to Learn Paige–Tarjan Partition Refinement: Blocks, Splitters, Bisimulation, Relational Coarsest Partitions and O(m log n) Engineering
Learn Paige–Tarjan partition refinement from visual blocks and splitters to bisimulation, stable relational partitions, O(m log n) accounting, testing and professional model reduction.
-
How to Learn the Garsia–Wachs Algorithm: Alphabetic Binary Trees, Weighted Path Length, Ordered Leaves and O(n log n) Construction
Learn the Garsia–Wachs algorithm from first principles to professional implementation: alphabetic binary trees, weighted path length, ordered reconstruction, correctness and O(n log n) engineering.
-
How to Learn Reingold–Tilford Tree Layout: Tidy-Tree Aesthetics, Contours, Modifiers, Two-Pass Coordinates and Linear-Time Engineering
Learn Reingold–Tilford tidy-tree layout from beginner hierarchy drawing to professional visualization engineering: layout aesthetics, subtree contours, preliminary coordinates, modifiers, Buchheim’s linear-time improvement and D3.
-
How to Learn Murty’s Algorithm: Ranked Assignments, Partitioned Subproblems, Priority Queues and K-Best Data Association
Learn Murty’s algorithm from single-best assignment intuition to professional k-best ranked assignment: partitioned subproblems, constrained assignment solves, priority queues, ties, complexity and data-association engineering.
-
How to Learn the Hoshen–Kopelman Algorithm: Raster Scans, Union–Find Labels, Connectivity and Large-Scale Component Analysis
Learn the Hoshen–Kopelman algorithm from beginner grid intuition to professional connected-component labelling: raster scans, provisional labels, Union–Find equivalences, connectivity choices and large-scale image or lattice analysis.
-
How to Learn Dulmage–Mendelsohn Decomposition: Maximum Matchings, Structural Rank, Alternating Paths and Block-Triangular Sparse Systems
Learn Dulmage–Mendelsohn decomposition from bipartite-graph intuition to professional sparse-system analysis: maximum matchings, structural rank, alternating paths, coarse/fine blocks and solver-facing permutations.
