|
| 1 | +//A Hamiltonian cycle is a cycle in an undirected or directed graph that visits each vertex exactly once. |
| 2 | +// import visualization libraries { |
| 3 | +import org.algorithm_visualizer.*; |
| 4 | +import java.util.Random; |
| 5 | +// } |
| 6 | + |
| 7 | +class Main { |
| 8 | + // define tracer variables { |
| 9 | + GraphTracer graphTracer=new GraphTracer("GraphTracer"); |
| 10 | + LogTracer logTracer = new LogTracer("Console"); |
| 11 | + // } |
| 12 | + int n=8; |
| 13 | + int x[]; |
| 14 | + int found=0; |
| 15 | + int vis[]; |
| 16 | + int[][] adjacencyMatrix; |
| 17 | + void ham(int k) { |
| 18 | + while(true) |
| 19 | + { |
| 20 | + nextVal(k); |
| 21 | + if(x[k]==-1) |
| 22 | + return; |
| 23 | + if(k==n-1) |
| 24 | + { |
| 25 | + graphTracer.visit(x[0],x[k]); |
| 26 | + graphTracer.delay(); |
| 27 | + found=1; |
| 28 | + //Printint the cycle{ |
| 29 | + for(int i=0;i<n;i++) |
| 30 | + logTracer.print((x[i])+" "); |
| 31 | + logTracer.println(0); |
| 32 | + //} |
| 33 | + graphTracer.leave(x[0],x[k]); |
| 34 | + } |
| 35 | + else |
| 36 | + ham(k+1); |
| 37 | + } |
| 38 | + } |
| 39 | + void nextVal(int k) |
| 40 | + { |
| 41 | + while(true) { |
| 42 | + int i=0; |
| 43 | + if(vis[k]==1) |
| 44 | + graphTracer.leave(x[k],x[k-1]); |
| 45 | + vis[k]=0; |
| 46 | + x[k]=(x[k]+1)%(n+1); |
| 47 | + if(x[k]==n) |
| 48 | + { |
| 49 | + x[k]=-1; |
| 50 | + return; |
| 51 | + } |
| 52 | + graphTracer.visit(x[k],x[k-1]); |
| 53 | + graphTracer.delay(); |
| 54 | + vis[k]=1; |
| 55 | + if (adjacencyMatrix[x[k-1]][x[k]]==1) |
| 56 | + { |
| 57 | + for(i=0;i<k;i++) |
| 58 | + if(x[i]==x[k]) |
| 59 | + break; |
| 60 | + if(i==k) |
| 61 | + if(k<n-1 || k==n-1 && adjacencyMatrix[x[k]][x[0]]==1) |
| 62 | + return; |
| 63 | + } |
| 64 | + } |
| 65 | + } |
| 66 | + |
| 67 | + Main() { |
| 68 | + //initializing{ |
| 69 | + adjacencyMatrix=new int[n][n]; |
| 70 | + x=new int[n]; |
| 71 | + vis=new int[n]; |
| 72 | + Random r=new Random(); |
| 73 | + for(int i=1;i<n;i++) |
| 74 | + x[i]=-1; |
| 75 | + //} |
| 76 | + |
| 77 | + //Randomizing adjacancy matrix and displaying on log screen{ |
| 78 | + logTracer.println("The adjacancy Matrix is"); |
| 79 | + for(int i=0;i<n;i++){ |
| 80 | + for(int j=0;j<n;j++){ |
| 81 | + adjacencyMatrix[i][j]=r.nextInt(2); |
| 82 | + logTracer.print(adjacencyMatrix[i][j]+" "); |
| 83 | + } |
| 84 | + logTracer.println(""); |
| 85 | + } |
| 86 | + //} |
| 87 | + |
| 88 | + // visualize { |
| 89 | + Layout.setRoot(new VerticalLayout(new Commander[]{graphTracer, logTracer})); |
| 90 | + graphTracer.set(adjacencyMatrix); |
| 91 | + // } |
| 92 | + |
| 93 | + logTracer.println("the possible solutios are"); |
| 94 | + ham(1); |
| 95 | + if(found==0) |
| 96 | + logTracer.println("No cycles are found Try with a different graph "); |
| 97 | + } |
| 98 | + |
| 99 | + public static void main(String[] args) { |
| 100 | + new Main(); |
| 101 | + } |
| 102 | +} |
0 commit comments