formatting work

2017-01-29 16:03:33 +02:00
parent 44bf48068f
commit 034cde6e20
42 changed files with 455 additions and 700 deletions
@@ -55,29 +55,19 @@ public class DijkstraAlgorithmTest {
        for (Node node : graph.getNodes()) {
            switch (node.getName()) {
            case "B":
-                assertTrue(node
-                  .getShortestPath()
-                  .equals(shortestPathForNodeB));
+                assertTrue(node.getShortestPath().equals(shortestPathForNodeB));
                break;
            case "C":
-                assertTrue(node
-                  .getShortestPath()
-                  .equals(shortestPathForNodeC));
+                assertTrue(node.getShortestPath().equals(shortestPathForNodeC));
                break;
            case "D":
-                assertTrue(node
-                  .getShortestPath()
-                  .equals(shortestPathForNodeD));
+                assertTrue(node.getShortestPath().equals(shortestPathForNodeD));
                break;
            case "E":
-                assertTrue(node
-                  .getShortestPath()
-                  .equals(shortestPathForNodeE));
+                assertTrue(node.getShortestPath().equals(shortestPathForNodeE));
                break;
            case "F":
-                assertTrue(node
-                  .getShortestPath()
-                  .equals(shortestPathForNodeF));
+                assertTrue(node.getShortestPath().equals(shortestPathForNodeF));
                break;
            }
        }