| 17 | // Repeat step 3 and 4 until the queue becomes empty. |
| 18 | |
| 19 | void bfs(int n, vector<int>adj[]) |
| 20 | { |
| 21 | vector<bool> visit(v,false); |
| 22 | queue<int> q; |
| 23 | q.push(n); |
| 24 | visit[n]=true; |
| 25 | while(!q.empty()) |
| 26 | { |
| 27 | n=q.front(); |
| 28 | cout<<n<<" "; |
| 29 | q.pop(); |
| 30 | for(int i=0;i<adj[n].size();i++) |
| 31 | { |
| 32 | if(!visit[adj[n][i]]) |
| 33 | { |
| 34 | q.push(adj[n][i]); |
| 35 | visit[adj[n][i]]=true; |
| 36 | } |
| 37 | } |
| 38 | } |
| 39 | } |
| 40 | |
| 41 | /************************************* ALGORITHM FOR DEPTH FIRST SEARCH ******************************************************/ |
| 42 |