Shortest Path Patterns
Choose the right algorithm for the graph: BFS (unweighted), 0-1 BFS (weights 0/1), Dijkstra (non-negative), Bellman-Ford (negative), Floyd-Warshall (all pairs), DAG DP.
Intermediate
Model states as nodes — e.g. (cell, keys collected) — to apply them to puzzles.
Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.
Discussion (0)
Sign in or join free to ask questions and discuss this topic.