69 lines
1.6 KiB
Java
69 lines
1.6 KiB
Java
package de.normalisiert.utils.graphs;
|
|
|
|
|
|
import java.util.List;
|
|
|
|
|
|
/**
|
|
* Testfile for elementary cycle search.
|
|
*
|
|
* @author Frank Meyer
|
|
*
|
|
*/
|
|
public class TestCycles {
|
|
|
|
/**
|
|
* @param args
|
|
*/
|
|
public static void main(String[] args) {
|
|
if (args.length < 2) {
|
|
System.out.println("usage: de.normalisiert.utils.graphs.TestCycles num_vertices [v1,v2...]");
|
|
System.exit(1);
|
|
}
|
|
|
|
int num_vertices = Integer.parseInt(args[0]);
|
|
|
|
String nodes[] = new String[num_vertices];
|
|
boolean adjMatrix[][] = new boolean[num_vertices][num_vertices];
|
|
|
|
for (int i = 0; i < num_vertices; i++) {
|
|
nodes[i] = Integer.toString(i);
|
|
}
|
|
|
|
/*adjMatrix[0][1] = true;
|
|
adjMatrix[1][2] = true;
|
|
adjMatrix[2][0] = true;
|
|
adjMatrix[2][4] = true;
|
|
adjMatrix[1][3] = true;
|
|
adjMatrix[3][6] = true;
|
|
adjMatrix[6][5] = true;
|
|
adjMatrix[5][3] = true;
|
|
adjMatrix[6][7] = true;
|
|
adjMatrix[7][8] = true;
|
|
adjMatrix[7][9] = true;
|
|
adjMatrix[9][6] = true;*/
|
|
|
|
for (int i = 1; i < args.length; i++) {
|
|
String[] vertices = args[i].split(",", 2);
|
|
int v1 = Integer.parseInt(vertices[0]);
|
|
int v2 = Integer.parseInt(vertices[1]);
|
|
adjMatrix[v1][v2] = true;
|
|
}
|
|
|
|
ElementaryCyclesSearch ecs = new ElementaryCyclesSearch(adjMatrix, nodes);
|
|
List cycles = ecs.getElementaryCycles();
|
|
for (int i = 0; i < cycles.size(); i++) {
|
|
List cycle = (List) cycles.get(i);
|
|
for (int j = 0; j < cycle.size(); j++) {
|
|
String node = (String) cycle.get(j);
|
|
if (j < cycle.size() - 1) {
|
|
System.out.print(node + " ");
|
|
} else {
|
|
System.out.print(node);
|
|
}
|
|
}
|
|
System.out.print("\n");
|
|
}
|
|
}
|
|
|
|
}
|