Connectivity on Jeanphilo Bloghttps://shio-chan-dev.github.io/jeanblog/tags/connectivity/Recent content in Connectivity on Jeanphilo BlogHugo -- 0.159.2en-usMon, 09 Feb 2026 10:00:28 +0800Dynamic Graphs and Incremental Computation: ACERS Guide to Incremental Shortest Path, Incremental PageRank, and Connectivity Maintenancehttps://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/90-dynamic-graph-incremental-computation/Mon, 09 Feb 2026 10:00:28 +0800https://shio-chan-dev.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.