From e8202d28e71afd4a0daee8944568836bf247f422 Mon Sep 17 00:00:00 2001 From: Jonas Smedegaard Date: Thu, 1 May 2025 12:17:24 +0200 Subject: internalize utility function disjoint(), i.e. make it a method --- src/dk.biks.bachelorizer/dk/biks/bachelorizer/Graph.java | 14 ++++---------- 1 file changed, 4 insertions(+), 10 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 a7689f8..f24264c 100644 --- a/src/dk.biks.bachelorizer/dk/biks/bachelorizer/Graph.java +++ b/src/dk.biks.bachelorizer/dk/biks/bachelorizer/Graph.java @@ -120,11 +120,8 @@ public final class Graph extends Storage { /// sets of disjoint choices /// - /// @param g Graph to inspect /// @return list of disjoint sets - public static ArrayList> disjoint( - final AbstractGraph g - ) { + public ArrayList> disjoint() { // get all subject modules // @@ -132,17 +129,14 @@ public final class Graph extends Storage { List modules = new ArrayList<>(g.vertices()); Collections.shuffle(modules); - return disjoint(g, modules); + return disjoint(modules); } /// groups of disjoint choices seeded by priority list of choices /// - /// @param g Graph to inspect /// @param vip Ordered list of subject modules to prioritize /// @return List of sets of disjoint choices - public static ArrayList> disjoint( - final AbstractGraph g, final List vip - ) { + public ArrayList> disjoint(final List vip) { ArrayList> sets = new ArrayList<>(); // track done subject modules as extendable set @@ -299,7 +293,7 @@ public final class Graph extends Storage { + " (otherwise an exception was thrown)"); // collect disjoint choice sets - ArrayList> s = disjoint(g); + ArrayList> s = disjoint(); System.out.printf( "\n\n%d disjoint choice sets collected:\n", s.size()); -- cgit v1.2.3