LeetCode 882: Reachable Nodes In Subdivided Graph
A clear explanation of counting reachable original and subdivided nodes using Dijkstra's shortest path algorithm.
Tag
Dijkstra
5 notes
LeetCode 778: Swim in Rising Water
A clear explanation of finding the minimum time to reach the bottom-right cell using a priority queue and minimax path reasoning.
LeetCode 743: Network Delay Time
Find the time needed for a signal to reach all nodes in a directed weighted graph using Dijkstra's algorithm.
LeetCode 505: The Maze II
A clear explanation of finding the shortest rolling distance in a maze using Dijkstra’s algorithm.
LeetCode 499: The Maze III
A clear explanation of finding the shortest rolling-ball path to the hole using Dijkstra with lexicographic tie-breaking.