void dfs(int node, vector<int> adjLs[], int vis[]) { // mark the more as visited vis[node] = 1; for(auto it: adjLs[node]) { if(!vis[it]) { dfs(it, adjLs, vis); } } }
Preview:
downloadDownload PNG
downloadDownload JPEG
downloadDownload SVG
Tip: You can change the style, width & colours of the snippet with the inspect tool before clicking Download!
Click to optimize width for Twitter