https://shio-chan-dev.github.io/jeanblog/tags/graph/Recent content in Graph on Jeanphilo BlogHugo -- 0.159.2en-usThu, 19 Mar 2026 13:18:26 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/133-clone-graph/Thu, 19 Mar 2026 13:18:26 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/133-clone-graph/Clone a connected undirected graph by mapping original nodes to cloned nodes, with DFS and BFS variants, cycle handling, correctness reasoning, and runnable implementations in six languages.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/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/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.