Java program to print the complete DFS - traversal of graph using back - tracking
import java . io . * ; import java . util . * ; class GFG { static int N = 1000 ; static ArrayList < ArrayList < Integer > > adj = new ArrayList < ArrayList < Integer > > ( ) ;