import java.util.*;
class Graph2 {
int [][] adjMatrix;
int rootNode = 0;
int NNodes;
boolean [] visited;
Graph2(int N){
NNodes = N;
adjMatrix = new int[N][N];
visited = new boolean[N];
}
Graph2(int [][] mat){
NNodes = mat.length;
visited = new boolean[NNodes];
for(int i = 0; i < NNodes; i++){
for(int j = 0; j < NNodes; j++){
adjMatrix[i][j] = mat[i][j];
}
}
}
int getUnvisitedChildNode(int n){
for(int j = 0; j < NNodes; j++){
if()
}
}
public static void main(String[] args) {
System.out.println("Hello JP!");
}
}
