public static void main(String[] args) {
Vertex v0 = new Vertex("Harrisburg");
Vertex v1 = new Vertex("Baltimore");
Vertex v2 = new Vertex("Washington");
Vertex v3 = new Vertex("Philadelphia");
Vertex v4 = new Vertex("Binghamton");
Vertex v5 = new Vertex("Allentown");
Vertex v6 = new Vertex("New York");
ArrayList<Vertex> vertexes = new ArrayList<>();
vertexes.add(v0);
vertexes.add(v1);
vertexes.add(v2);
vertexes.add(v3);
vertexes.add(v4);
vertexes.add(v5);
vertexes.add(v6);
ArrayList<Edge> edges = new ArrayList<>();
edges.add(new Edge(v2, v1, 10));
edges.add(new Edge(v3, v0, 3));
edges.add(new Edge(v2, v3, 1));
edges.add(new Edge(v4, v2, 100));
edges.add(new Edge(v5, v4, 6));
edges.add(new Edge(v6, v4, 30));
edges.add(new Edge(v0, v6, 20));
edges.add(new Edge(v3, v4, 5));
// Dijkstra DJ = new Dijkstra();
Dijkstra.computePaths(v5);
System.out.println("Vzdalenost do v0: " + v0.minDistance);
List<Vertex> path = Dijkstra.getShortestPathTo(v0);
System.out.println("Cesta přes: " + path);
}
/**
* Loads the graph from the input file. Runs Dijktra's algorithm on every origin node and for each
* destination node, compares the returned path with the correct path in the resultsFile.
*
* @param inputFile
* @param resultsFile
* @return
* @throws IOException
*/
public static boolean testDijkstra(String inputFile, String resultsFile) throws IOException {
Dijkstra dijkstra = new Dijkstra(inputFile);
MapGraph gr = dijkstra.getGraph();
BufferedReader br = null;
try {
br = new BufferedReader(new FileReader(resultsFile));
String s;
for (int i = 0; i < gr.numNodes(); i++) {
CityNode originNode = gr.getNode(i);
String originCity = originNode.getCity();
s = br.readLine();
if (s == null) {
System.out.println("Error reading from the resultsFile");
return false;
}
assert (s.equals(originCity));
// Run Dijkstra's algorithm to compute the paths from originCity
// to all other nodes
dijkstra.computePaths(originNode);
// Go along all the destinations
for (int j = 0; j < gr.numNodes(); j++) {
if (j != i) {
CityNode destNode = gr.getNode(j);
String destCity = destNode.getCity();
// get the path between originCity and destCity
ArrayList<Integer> path = dijkstra.shortestPath(destNode);
String pathString = br.readLine();
if (pathString == null) {
System.out.println("Error reading from the resultsFile");
return false;
}
String[] expectedPath = pathString.split(" ");
if (path.size() != expectedPath.length) {
System.out.println("Your path's size = " + path.size());
System.out.println("Expected the path of size: " + expectedPath.length);
DijkstraTest.printInfo(originCity, destCity, path, expectedPath, gr);
return false;
}
assert (expectedPath[expectedPath.length - 1].equals(destCity));
// comparing the cities on the returned path and the expected path
for (int k = 0; k < path.size(); k++) {
Integer num = path.get(k);
CityNode nodeOnPath = gr.getNode(num);
String cityString = nodeOnPath.getCity();
if (!cityString.equals(expectedPath[k])) {
DijkstraTest.printInfo(originCity, destCity, path, expectedPath, gr);
return false;
}
} // for loop on nodes on the path
} // if i!=j
} // for destinations
} // for origins
} catch (IOException e) {
e.getMessage();
}
return true;
}
