https://shio-chan-dev.github.io/jeanblog/tags/bfs/Recent content in Bfs 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/alg/leetcode/hot100/binary-tree/102-binary-tree-level-order-traversal/Mon, 16 Mar 2026 13:00:56 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/binary-tree/102-binary-tree-level-order-traversal/A practical guide to LeetCode 102 covering level-by-level BFS, level-size boundaries, DFS depth buckets, and runnable multi-language implementations.https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/binary-tree/101-symmetric-tree/Mon, 16 Mar 2026 13:00:55 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/binary-tree/101-symmetric-tree/A practical guide to LeetCode 101 covering mirror recursion, pairwise BFS checks, symmetry contracts, and runnable multi-language implementations.https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/binary-tree/100-same-tree/Mon, 16 Mar 2026 13:00:54 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/binary-tree/100-same-tree/A practical guide to LeetCode 100 covering synchronous recursion, pairwise BFS validation, structural equivalence, and runnable multi-language implementations.https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/binary-tree/226-invert-binary-tree/Fri, 06 Mar 2026 17:58:23 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/binary-tree/226-invert-binary-tree/A practical guide to LeetCode 226 covering tree mirroring, recursive left-right swaps, BFS traversal, and engineering mappings.https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/binary-tree/104-maximum-depth-of-binary-tree/Fri, 06 Mar 2026 17:58:22 +0800https://shio-chan-dev.github.io/jeanblog/alg/leetcode/hot100/binary-tree/104-maximum-depth-of-binary-tree/A practical guide to LeetCode 104 covering the depth definition, recursive DFS, level-order BFS, engineering mappings, 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/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.