> For the complete documentation index, see [llms.txt](https://gopavasanth.gitbook.io/code/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://gopavasanth.gitbook.io/code/geeksforgeeks-sudo-placement-2019/geeksforgeeks-sudo-placement-2019/sp-graphs.md).

# sp-graphs

https\://practice.geeksforgeeks.org/tracks/sp-graph/?batchId=152

[**DFS of Graph**](https://practice.geeksforgeeks.org/problems/depth-first-traversal-for-a-graph/1/?track=sp-graph\&batchId=152)

[**BFS of graph**](https://practice.geeksforgeeks.org/problems/bfs-traversal-of-graph/1/?track=sp-graph\&batchId=152)\
Learned on 20th July 2020

```cpp
vector <int> bfs(vector<int> g[], int N) {
    queue<int> q;

    bool *visited= new bool[N+1]{false};
    vector<int> ans;
    
    q.push(0);
    while(!q.empty()){
        for(auto node: g[q.front()]){
            if(! visited[node]){
                q.push(node);
                visited[node]= true;
            }
        }
        ans.push_back(q.front());
        q.pop();
    }
    return ans;
}
```

<br>