https://shio-chan-dev.github.io/jeanblog/tags/graph-algorithms/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/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/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.