Consider an undirected graph where each edge weighs $6$ units. Each of the nodes is labeled consecutively from $1$ to n$.$

You will be given a number of queries. For each query, you will be given a list of edges describing an undirected graph. After you create a representation of the graph, you must determine and report the shortest distance to each of the other nodes from a given starting position using the breadth$-$first search algorithm $($BFS$).$ Return an array of distances from the start node in node number order. If a node is unreachable, return $-1$ for that node.

Function Description

Complete the bfs function in the editor below. If a node is unreachable, its distance is $-1.$

bfs has the following parameter$($s$)$:

int n: the number of nodes

int m: the number of edges

int edges$[$m$][2]$: start and end nodes for edges

int s: the node to start traversals from

Returns

int$[$n$-1]$: the distances to nodes in increasing node number order, not including the start node $(-1$ if a node is not reachable$)$