-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathInstanceMaker3.java
More file actions
132 lines (123 loc) · 3.17 KB
/
InstanceMaker3.java
File metadata and controls
132 lines (123 loc) · 3.17 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
import java.util.ArrayList;
import java.io.*;
import java.util.Collections;
import java.util.*;
public class InstanceMaker3{
static PrintWriter writer;
static int[][] graphVertices;
static ArrayList<Integer> randomVertex;
static int row, col, vcount;
static HashMap<Integer, ArrayList<Integer>> dict;
public static void initializer(int row, int col) {
vcount = row * col;
writer.println(vcount);
writer.println("");
randomVertex = new ArrayList();
for (int i = 0; i < vcount; i++) {
randomVertex.add(i);
}
Collections.shuffle(randomVertex);
graphVertices = new int[row][];
ListIterator<Integer> iterator = randomVertex.listIterator();
for (int i = 0; i < row; i++) {
int[] newColumn = new int[col];
for (int j = 0; j < col; j++) {
int index = (i*col) + j;
newColumn[j] = iterator.next();
}
graphVertices[i] = newColumn;
System.out.println(graphVertices[i][0]);
}
dict = new HashMap<Integer, ArrayList<Integer>>();
ArrayList stuff;
// column edges
for (int i = 0; i < row; i += 1) {
if (i % 2 == 0) {
for (int j = 0; j < col; j += 2) {
stuff = new ArrayList();
if (i != 0) {
stuff.add(graphVertices[i - 1][j]);
} else {
stuff.add(graphVertices[row - 1][j]);
}
if (i != row - 1) {
stuff.add(graphVertices[i + 1][j]);
} else {
stuff.add(graphVertices[0][j]);
}
dict.put(graphVertices[i][j], stuff);
}
} else {
for (int j = 1; j < col; j += 2) {
stuff = new ArrayList();
stuff.add(graphVertices[i - 1][j]);
if (i != row - 1) {
stuff.add(graphVertices[i + 1][j]);
} else {
stuff.add(graphVertices[0][j]);
}
dict.put(graphVertices[i][j], stuff);
}
}
}
for (int j = 0; j < col; j += 1) {
if (j % 2 == 0) {
for (int i = 1; i < row; i += 2) {
stuff = new ArrayList();
if (j != 0) {
stuff.add(graphVertices[i][j - 1]);
} else {
stuff.add(graphVertices[i][col - 1]);
}
if (j != col - 1) {
stuff.add(graphVertices[i][j + 1]);
} else {
stuff.add(graphVertices[i][0]);
}
dict.put(graphVertices[i][j], stuff);
}
} else {
for (int i = 0; i < row; i += 2) {
stuff = new ArrayList();
stuff.add(graphVertices[i][j - 1]);
if (j != col - 1) {
stuff.add(graphVertices[i][j + 1]);
} else {
stuff.add(graphVertices[i][0]);
}
dict.put(graphVertices[i][j], stuff);
}
}
}
System.out.println(dict.entrySet());
}
public static void matrixfy() {
for (int i = 0; i < vcount; i++) {
String matrix = "";
for (int j = 0; j < vcount; j++) {
if (dict.get(i).contains(j)) {
matrix += "1";
} else {
matrix += "0";
}
if (j != vcount - 1) {
matrix += " ";
}
}
//System.out.println(matrix);
writer.println(matrix);
}
}
public static void main(String[] args) {
File file = new File("CYCLECONNECTEDALLSIDES.in");
try {
writer = new PrintWriter(file);
InstanceMaker3.initializer(22, 22);
InstanceMaker3.matrixfy();
writer.close();
}
catch (FileNotFoundException ex) {
// insert code to run when exception occurs
}
}
}