package hamierton;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Random;
public class EularCircuit {
public EularCircuit() {
}
public static void main(String[] args) {
// System.out.println("please input n:");
// BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
int n = 4;
try {
// n = Integer.parseInt(br.readLine());
} catch (Exception ex) {
return;
}
try {
Graph g = new Graph(n);
g.printg();
g.circuit();
} catch (Exception e) {
System.out.println(e.toString());
e.printStackTrace();
return;
}
}
}
class Node {
private static int count = 0;
private String name;
private ArrayList adjacencyList;
private boolean visited =false;
public Node() {
name = "node " + count;
adjacencyList = new ArrayList();
}
public Node(String name) {
this.name = name;
adjacencyList = new ArrayList();
}
public boolean isAllVisited() {
for (int i = 0; i < adjacencyList.size(); i++) {
SNode sn = (SNode) adjacencyList.get(i);
if (sn.visited == false) {
return false;
}
}
return true;
}
public boolean isvisited(){
return visited;
