diff options
Diffstat (limited to 'src/dk.biks.bachelorizer/dk/biks/bachelorizer/Graph.java')
| -rw-r--r-- | src/dk.biks.bachelorizer/dk/biks/bachelorizer/Graph.java | 11 |
1 files changed, 6 insertions, 5 deletions
diff --git a/src/dk.biks.bachelorizer/dk/biks/bachelorizer/Graph.java b/src/dk.biks.bachelorizer/dk/biks/bachelorizer/Graph.java index 1382a4a..29b4759 100644 --- a/src/dk.biks.bachelorizer/dk/biks/bachelorizer/Graph.java +++ b/src/dk.biks.bachelorizer/dk/biks/bachelorizer/Graph.java @@ -62,17 +62,17 @@ public final class Graph { assertConnected(g); System.out.println( "\n\nGraph is connected" - +" (otherwise an exception was thrown)"); + + " (otherwise an exception was thrown)"); // collect disjoint choice sets ArrayList<Set<Vertex>> s = disjoint(g); System.out.printf( "\n\n%d disjoint choice sets collected:\n", s.size()); - for(Set<Vertex> verticeSet: s) { - System.out.print("set("+verticeSet.size()+"):"); + for (Set<Vertex> verticeSet: s) { + System.out.print("set(" + verticeSet.size() + "):"); for (Vertex v: GraphAlgorithms.sortVertex(verticeSet)) { - System.out.print(" "+v.toString()); + System.out.print(" " + v.toString()); } System.out.println(); } @@ -118,7 +118,7 @@ public final class Graph { /// since visitDepthFirst() recurses out-edges of all vertices. /// /// @param g Graph to inspect - /// @throws IllegalArgumentException + /// @throws IllegalArgumentException /// https://docs.oracle.com/javase/tutorial/essential/exceptions/runtime.html public static void assertConnected(final AbstractGraph g) { @@ -223,6 +223,7 @@ public final class Graph { h.insertEdge(s.toString(), t.toString(), sum); } } + return h; } |