irapilguy

DFS

Nov 20th, 2017
141
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.13 KB | None | 0 0
  1. void dfs(int v) {
  2.     used[v] = 1;
  3.     for (int i = 1; i <= n; i++) {
  4.         if (used[i] == 0 && mas[v][i] == 1) {
  5.             dfs(i);
  6.         }
  7.     }
  8. }
Add Comment
Please, Sign In to add comment