Shortest Paths and Nodes on Any Shortest Path

Part 1: Find a Shortest Path

Problem Statement

Given an undirected, unweighted graph as an adjacency dictionary with integer node IDs, implement shortest_path(graph, start, target) to return any shortest path, including both endpoints. Every...