Shortest Paths in Unweighted Graph

Problem

Given an unweighted graph with n nodes labeled from 0 to n - 1, an edge list edges, and a source node src, return an array dist where dist[i] is the length of the shortest path from src to node i. If a node is unreachable, return -1 for that node. The graph is undirected.

Constraints

• 1 <= n <= 10^5
• 0 <= edges.length <= 2 * 10^5
• 0 <= u, v < n for every edge [u, v]
• 0 <= src < n
• The graph is unweighted and undirected