import java.util.*; import java.io.*; public class Certificate { // single successor model of a graph private int n; // number of vertices private int[] deg; // degree of vertex private boolean[][] adj; // adj[i][j] = 1 <-> vertex i is adjacent to vertex j private int[][] adjList; // adjList[i] is list of vertices adjacent to vertex i private int[] tour; // list of edges that make a tour (we hope) as single successors private boolean[] visited; // is a vertex visited by the tour? public Certificate(String problem, String solution) throws Exception { MyIo finP = new MyIo(problem); n = finP.getNextInt(); deg = new int[n]; adj = new boolean[n][n]; adjList = new int[n][]; tour = new int[n]; visited = new boolean[n]; for (int i=0;i