Advertisement
Guest User

Untitled

a guest
Sep 15th, 2019
80
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.34 KB | None | 0 0
  1. #define nodesnum 100
  2. vector<int> adj[nodesnum];
  3. int visited[nodesnum];
  4.  
  5. void dfs(int s)
  6. {
  7.     visited[s] = true;
  8.     for(int i=0; i<adj[s].size(); i++) {
  9.         if(visited[ adj[s][i] ] == false ) {
  10.             dfs(adj[s][i]);
  11.         }
  12.     }
  13. }
  14.  
  15. void initialize()
  16. {
  17.     for(int i=0; i<nodesnum; i++)
  18.         visited[i] = false;
  19. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement