Advertisement
Guest User

Untitled

a guest
Nov 18th, 2017
60
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 u,int d = 0, int p = -1){
  2.   s.insert({d,u});
  3.   depth[u] = d;
  4.   for(auto v:adj[u])
  5.     if (v!=p)
  6.       dfs(v,d+1,u);
  7. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement