From 705b7a5a32793f7ed8a24b8b35afe3f9d49348be Mon Sep 17 00:00:00 2001 From: Jonas Smedegaard Date: Tue, 29 Apr 2025 07:19:10 +0200 Subject: tidy whitespace --- src/dk.biks.bachelorizer/dk/biks/bachelorizer/Graph.java | 11 ++++++----- 1 file changed, 6 insertions(+), 5 deletions(-) (limited to 'src/dk.biks.bachelorizer/dk/biks/bachelorizer/Graph.java') 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> s = disjoint(g); System.out.printf( "\n\n%d disjoint choice sets collected:\n", s.size()); - for(Set verticeSet: s) { - System.out.print("set("+verticeSet.size()+"):"); + for (Set 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; } -- cgit v1.2.3