Given a directed graph. The task is to do Breadth First Search of this graph.
The first line of the input contains an integer 'T' denoting the number of test cases. Then 'T' test cases follow. Each test case consists of two lines. Description of testcases is as follows: The First line of each test case contains two integers 'N' and 'E' which denotes the no of vertices and no of edges respectively. The Second line of each test case contains 'E' space separated pairs u and v denoting that there is a edge from u to v .
For each testcase, print the BFS of the graph starting from 0.
Note: The expected output button always produces BFS starting from node 0.
You don't need to read input or print anything. Your task is to complete the function bfs() takes the Graph and the number of vertices as its input and returns a list containing the BFS traversal of the graph starting from the 0th vertex.
Expected Time Complexity: O(V + E).
Expected Auxiliary Space: O(V).
1 <= T <= 100
2 <= N <= 104
1 <= E <= (N*(N-1))/2
Graph doesn't contain multiple edges and self loops.
0 1 0 2 0 3 2 4
0 1 0 2
0 1 2 3 4 // BFS from node 0
0 1 2
0 is connected to 1 , 2 , 3
2 is connected to 4
so starting from 0 , bfs will be 0 1 2 3 4.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.