I want to implement DFS, BFS using vector of vectors. Can someone help me with that? I have never code using vector, so it is a bit tough for me i guess.

# DFS, BFS using Vectors

**shashank0j**#3

void bfs(int s,vector adj[],bool vis[])

can someone help me ? how can i find the size of adj[] ?

**sid_somani**#4

Refer Geeks for Geeks for graph+stl solutions. Here is the link for dfs using vectors http://www.geeksforgeeks.org/graph-implementation-using-stl-for-competitive-programming-set-1-dfs-of-unweighted-and-undirected/

**ranjan_1997**#5

Refer to this link. Probably the best if you are a beginner in graphs c++.

Graph Theory Part - 1

If you can do it with arrays you can do it with vectors. If you can’t do it with arrays you need to learn dfs/bfs and solve some questions.

**betlista**#9

Try to solve this problem - http://www.codechef.com/problems/PETERSEN using BFS…

We can help you if you got stucked

Try to solve this problem - http://www.codechef.com/problems/FIRESC (DFS) also

**dishant_18**#10

Well you have probably made a 2D vector and size of adj* (i.e no. of columns of a particular row) can be found simply using “adj*.size()” whereas the size of adj[] (i.e. no. of rows of 2D vector) has to be passed in the function!