Given an unweighted graph represented using adjacency lists and a source vertex s, compute the shortest path from the source vertex to all other vertices.

Finding the shortest path between two points is one of the most fundamental problems in computer science and mathematics. Graph theory provides an efficient way to model real-world systems such as ...