https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/Recent content in Graph Algorithms on Jeanphilo BlogHugo -- 0.159.2en-usMon, 09 Feb 2026 10:14:45 +0800https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/00-graph-algorithms-learning-path/Mon, 09 Feb 2026 10:14:45 +0800https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/00-graph-algorithms-learning-path/A graph algorithms topic guide and recommended reading order covering BFS/DFS, reachability, shortest paths, CC/SCC, centrality, PageRank, community detection, subgraph matching, dynamic graphs, graph partitioning, and graph computation models.https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/110-graph-computation-models-pregel-gas-parallel-bfs/Mon, 09 Feb 2026 10:05:33 +0800https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/110-graph-computation-models-pregel-gas-parallel-bfs/An engineering implementation framework centered on graph computation models: core abstractions, synchronization semantics, performance boundaries of Pregel and GAS, plus implementation and selection guidance for PageRank/CC/parallel BFS.https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/100-graph-partitioning-edge-cut-vertex-cut-metis/Mon, 09 Feb 2026 10:04:05 +0800https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/100-graph-partitioning-edge-cut-vertex-cut-metis/A practical graph partitioning guide for production graph databases, covering Edge-cut vs Vertex-cut, the core METIS workflow, runnable examples, and an engineering tuning checklist.https://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.https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/80-community-detection-louvain-label-propagation/Mon, 09 Feb 2026 09:59:58 +0800https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/80-community-detection-louvain-label-propagation/Centered on three core community-detection use cases (group identification, graph partitioning, and cold-start analysis), this article explains Louvain and Label Propagation with principles, complexity, engineering trade-offs, and runnable multi-language implementations.https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/70-subgraph-matching-vf2-ullmann-and-pruning/Mon, 09 Feb 2026 09:59:16 +0800https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/70-subgraph-matching-vf2-ullmann-and-pruning/A systematic guide to Subgraph Isomorphism (NP-hard) and the core ideas of VF2/Ullmann, with emphasis on engineering reality: constrained pattern queries and candidate pruning usually matter more than the algorithm name itself.https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/50-graph-centrality-degree-betweenness-closeness/Mon, 09 Feb 2026 09:56:11 +0800https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/50-graph-centrality-degree-betweenness-closeness/A systematic guide to the three core graph centrality metrics: Degree, Betweenness, and Closeness. The key engineering takeaway: most production systems prioritize Degree and approximate Betweenness, with clear complexity and rollout tradeoffs.https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/60-pagerank-and-personalized-pagerank/Mon, 09 Feb 2026 09:54:25 +0800https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/60-pagerank-and-personalized-pagerank/A systematic explanation of PageRank and Personalized PageRank, from iterative computation and sparse-matrix implementation to incremental update strategies, covering core graph-database scenarios such as recommendation and influence analysis.https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/30-k-hop-reachability-and-reach-index/Mon, 09 Feb 2026 09:52:17 +0800https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/30-k-hop-reachability-and-reach-index/A systematic engineering guide to k-hop and reachability queries: BFS+hop limits, why full transitive closure is usually not maintained, and practical bitmap/2-hop reach-index strategies with runnable multi-language code.https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/40-connected-components-and-scc-tarjan-kosaraju/Mon, 09 Feb 2026 09:50:22 +0800https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/40-connected-components-and-scc-tarjan-kosaraju/A systematic guide to undirected Connected Components and directed SCCs, with emphasis on Tarjan (common in production) and Kosaraju, mapped to graph-database scenarios such as community pre-grouping, subgraph splitting, and partition hints.https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/20-shortest-path-bfs-dijkstra-astar-acers/Mon, 09 Feb 2026 09:48:00 +0800https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/20-shortest-path-bfs-dijkstra-astar-acers/A full engineering walkthrough of the shortest-path core trio: BFS for unweighted graphs, Dijkstra for non-negative weights, and heuristic A*. Includes multi-source BFS, bidirectional search, path pruning, and runnable multi-language templates.https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/10-bfs-dfs-k-hop-subgraph-path-existence/Mon, 09 Feb 2026 09:44:11 +0800https://shio-chan-dev.github.io/jeanblog/dev/algorithm/graph/10-bfs-dfs-k-hop-subgraph-path-existence/Centered on three high-frequency graph tasks (k-hop query, subgraph extraction, and path existence), this article explains practical BFS/DFS iteration templates, early-stop pruning, and visited bitmap/bloom choices with runnable multi-language implementations.