Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #define nodesnum 100
- vector<int> adj[nodesnum];
- int visited[nodesnum];
- void dfs(int s)
- {
- visited[s] = true;
- for(int i=0; i<adj[s].size(); i++) {
- if(visited[ adj[s][i] ] == false ) {
- dfs(adj[s][i]);
- }
- }
- }
- void initialize()
- {
- for(int i=0; i<nodesnum; i++)
- visited[i] = false;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement