https://leetcode-solutions-5zk.pages.dev/tags/shortest-path/Recent content in Shortest Path on LeetCode 题解笔记Hugozh-cn2026 ZenzZweiMon, 11 May 2026 12:12:02 +0800https://leetcode-solutions-5zk.pages.dev/posts/1976-number-of-ways-to-arrive-at-destination/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1976-number-of-ways-to-arrive-at-destination/Medium | Dynamic Programming, Graph Theory, Topological Sort, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/2045-second-minimum-time-to-reach-destination/Thu, 30 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2045-second-minimum-time-to-reach-destination/Hard | Breadth-First Search, Graph Theory, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/3286-find-a-safe-walk-through-a-grid/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3286-find-a-safe-walk-through-a-grid/Medium | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/3341-find-minimum-time-to-reach-last-room-i/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3341-find-minimum-time-to-reach-last-room-i/Medium | Array, Graph Theory, Heap (Priority Queue), Matrix, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/3342-find-minimum-time-to-reach-last-room-ii/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3342-find-minimum-time-to-reach-last-room-ii/Medium | Array, Graph Theory, Heap (Priority Queue), Matrix, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/3377-digit-operations-to-make-two-integers-equal/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3377-digit-operations-to-make-two-integers-equal/Medium | Math, Graph Theory, Heap (Priority Queue), Number Theory, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/3419-minimize-the-maximum-edge-weight-of-graph/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3419-minimize-the-maximum-edge-weight-of-graph/Medium | Binary Search, Depth-First Search, Breadth-First Search, Graph Theory, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/3594-minimum-time-to-transport-all-individuals/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3594-minimum-time-to-transport-all-individuals/Hard | Array, Bit Manipulation, Graph Theory, Heap (Priority Queue), Shortest Path, Bitmaskhttps://leetcode-solutions-5zk.pages.dev/posts/3604-minimum-time-to-reach-destination-in-directed-graph/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3604-minimum-time-to-reach-destination-in-directed-graph/Medium | Graph Theory, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/3620-network-recovery-pathways/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3620-network-recovery-pathways/Hard | Array, Binary Search, Dynamic Programming, Graph Theory, Topological Sort, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/3650-minimum-cost-path-with-edge-reversals/Mon, 27 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3650-minimum-cost-path-with-edge-reversals/Medium | Graph Theory, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/2976-minimum-cost-to-convert-string-i/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2976-minimum-cost-to-convert-string-i/Medium | Array, String, Graph Theory, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/2977-minimum-cost-to-convert-string-ii/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2977-minimum-cost-to-convert-string-ii/Hard | Array, String, Dynamic Programming, Graph Theory, Trie, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/3112-minimum-time-to-visit-disappearing-nodes/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3112-minimum-time-to-visit-disappearing-nodes/Medium | Array, Graph Theory, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/3123-find-edges-in-shortest-paths/Sun, 26 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/3123-find-edges-in-shortest-paths/Hard | Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/2642-design-graph-with-shortest-path-calculator/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2642-design-graph-with-shortest-path-calculator/Hard | Graph Theory, Design, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/2662-minimum-cost-of-a-path-with-special-roads/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2662-minimum-cost-of-a-path-with-special-roads/Medium | Array, Graph Theory, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/2699-modify-graph-edge-weights/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2699-modify-graph-edge-weights/Hard | Graph Theory, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/2959-number-of-possible-sets-of-closing-branches/Sat, 25 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2959-number-of-possible-sets-of-closing-branches/Hard | Bit Manipulation, Graph Theory, Heap (Priority Queue), Enumeration, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/2203-minimum-weighted-subgraph-with-the-required-paths/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2203-minimum-weighted-subgraph-with-the-required-paths/Hard | Graph Theory, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/2290-minimum-obstacle-removal-to-reach-corner/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2290-minimum-obstacle-removal-to-reach-corner/Hard | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/2577-minimum-time-to-visit-a-cell-in-a-grid/Fri, 24 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/2577-minimum-time-to-visit-a-cell-in-a-grid/Hard | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1334-find-the-city-with-the-smallest-number-of-neighbors-at-a-threshold-distance/Medium | Dynamic Programming, Graph Theory, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1368-minimum-cost-to-make-at-least-one-valid-path-in-a-grid/Hard | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/1514-path-with-maximum-probability/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1514-path-with-maximum-probability/Medium | Array, Graph Theory, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/1786-number-of-restricted-paths-from-first-to-last-node/Thu, 23 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/1786-number-of-restricted-paths-from-first-to-last-node/Medium | Dynamic Programming, Graph Theory, Topological Sort, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/0743-network-delay-time/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0743-network-delay-time/Medium | Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/0787-cheapest-flights-within-k-stops/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0787-cheapest-flights-within-k-stops/Medium | Dynamic Programming, Depth-First Search, Breadth-First Search, Graph Theory, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/0882-reachable-nodes-in-subdivided-graph/Wed, 22 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0882-reachable-nodes-in-subdivided-graph/Hard | Graph Theory, Heap (Priority Queue), Shortest Pathhttps://leetcode-solutions-5zk.pages.dev/posts/0399-evaluate-division/Mon, 20 Apr 2026 00:00:00 +0000https://leetcode-solutions-5zk.pages.dev/posts/0399-evaluate-division/Medium | Array, String, Depth-First Search, Breadth-First Search, Union-Find, Graph Theory, Shortest Path