Shortest Path in Directed GraphsCovers finding the shortest path in directed graphs efficiently using algorithmic approaches and discussing related NP-complete problems.
Union-Find and Prim's AlgorithmIntroduces Union-Find data structure and Prim's algorithm for minimum spanning trees in graphs, exploring cuts and historical origins.
LLL AlgorithmCovers the LLL algorithm for reducing lattice bases to shorter and more orthogonal forms through iterative transformations.
Coin Rendering: Part 1Covers coin rendering and the limitations of the greedy algorithm in finding optimal solutions.
Prim's and Kruskal's AlgorithmsExplores Prim's and Kruskal's algorithms for finding minimum spanning trees in a graph, covering their correctness, implementation, and analysis.
