DFS traversal in directed graph code example

Example: What would be the DFS traversal of the given Graph

#include <bits/stdc++.h>