dfs

public static int[] visited = new int[8];
public void traverse(int[][] G, int u){
    if (visited[u] == 0){
        System.out.print(u + " ");
        visited[u] = 1;

        for (int v = 1; v <G.length; v++){
            if (G[u][v] == 1 && visited[v] == 0){
                traverse(G, v);
            }
        }
    }
}