Category: Blog
-
How to Learn Hierholzer’s Algorithm: Euler Trails, Edge Consumption, Stack Splicing and Linear-Time Graph Traversal
A Learning Hall guide to Hierholzer’s algorithm, from Eulerian existence conditions and cycle splicing through stack implementations, edge IDs, linear complexity and modern memory engineering.
-
How to Learn Centroid Decomposition: Balanced Tree Separators, Centroid Trees, Distance Queries and Divide-and-Conquer
A Learning Hall guide to centroid decomposition, from tree centroids and recursive balance through centroid-tree invariants, distance queries, complexity, implementation and professional verification.
-
How to Learn Held–Karp Dynamic Programming: Bitmask States, Exact TSP, Tour Reconstruction and Exponential-Time Engineering
A Learning Hall guide to the Held–Karp exact TSP algorithm from subset-and-endpoint dynamic-programming states through bitmasks, route reconstruction, exponential complexity and professional implementation trade-offs.
-
How to Learn LZW Compression: Dictionaries, Variable-Width Codes, Decoding Edge Cases and Legacy Format Engineering
A Learning Hall guide to LZW compression from synchronised phrase dictionaries and encoder/decoder traces through variable-width codes, decoding edge cases, GIF rules and professional compatibility testing.
-
How to Learn Cuckoo Hashing: Two-Choice Placement, Displacement Chains, Cycles, Rehashing and Constant-Time Lookup
A Learning Hall guide to cuckoo hashing from two candidate locations and displacement chains through cycles, rehashing, graph interpretations, load factors and professional table engineering.
-
How to Learn Johnson’s Algorithm: Reweighting, Bellman–Ford Potentials, Dijkstra and Sparse-Graph APSP
A Learning Hall guide to Johnson’s algorithm from negative-edge shortest paths and Bellman–Ford potentials through reweighting proofs, repeated Dijkstra and professional sparse-graph APSP practice.
