https://jeanphilogong.github.io/jeanblog/tags/connectivity/Recent content in Connectivity on Jeanphilo BlogHugo -- 0.168.0en-usTue, 30 Jun 2026 00:00:00 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/union-find/union-find-template/Tue, 30 Jun 2026 00:00:00 +0800https://jeanphilogong.github.io/jeanblog/alg/leetcode/hot100/union-find/union-find-template/Derive the Python Union-Find template from a small set-merging task: parent, find, union, count, connected, and path compression.https://jeanphilogong.github.io/jeanblog/dev/algorithm/graph/90-dynamic-graph-incremental-computation/Mon, 09 Feb 2026 10:00:28 +0800https://jeanphilogong.github.io/jeanblog/dev/algorithm/graph/90-dynamic-graph-incremental-computation/For real-world graph systems, this article systematically explains dynamic graph incremental algorithms: incremental shortest path, incremental PageRank, and connectivity maintenance. It focuses on three core engineering techniques: local recomputation, lazy updates, and approximate results.