TestBellmanFordShortestPath.java 文件源码

private void assertShortestPath(String[] input) {
    for (String line : input) {
        String[] values = line.split(" ");
        switch (values[0]) {
            case "compute":
                bellmanFord.computeShortestPath(values[1]);
                break;
            case "shortestPath":
                String[] expected = values[2].split(",");
                if (expected[0].equals("empty")) {
                    assertThat(bellmanFord.getShortestPathTo(values[1]), IsEmptyCollection.empty());
                } else {
                    assertThat(bellmanFord.getShortestPathTo(values[1]), contains(expected));
                }
                break;
            case "shortestDistance":
                Integer expectedDistance = null;
                if (values[2].equals("infinity")) {
                    expectedDistance = Integer.MAX_VALUE;
                } else if (values[2].equals("-infinity")) {
                    expectedDistance = Integer.MIN_VALUE;
                } else {
                    expectedDistance = Integer.parseInt(values[2]);
                }
                assertThat(bellmanFord.getShortestDistanceTo(values[1]), is(expectedDistance));
                break;
        }
    }
}