From 24dc724b7076aaa40eb9697d616d3a4c8eb42925 Mon Sep 17 00:00:00 2001
From: Jonas Smedegaard <dr@jones.dk>
Date: Thu, 1 May 2025 12:56:21 +0200
Subject: internalize utility function moduleGroups(), i.e. make it a method

---
 src/dk.biks.bachelorizer/dk/biks/bachelorizer/Graph.java | 7 +++----
 1 file changed, 3 insertions(+), 4 deletions(-)

diff --git a/src/dk.biks.bachelorizer/dk/biks/bachelorizer/Graph.java b/src/dk.biks.bachelorizer/dk/biks/bachelorizer/Graph.java
index f24264c..dde2a24 100644
--- a/src/dk.biks.bachelorizer/dk/biks/bachelorizer/Graph.java
+++ b/src/dk.biks.bachelorizer/dk/biks/bachelorizer/Graph.java
@@ -185,10 +185,9 @@ public final class Graph extends Storage {
 	/// sum of students' selections as a graph
 	///
 	/// @param sets  list of disjoint choices
-	/// @param g     choices as weights in graph
 	/// @return      groups of disjoint choices as a graph
-	public static AbstractGraph moduleGroups(
-		final ArrayList<Set<Vertex>> sets, final AbstractGraph g
+	public AbstractGraph moduleGroups(
+		final ArrayList<Set<Vertex>> sets
 	) {
 		AbstractGraph h = new AdjListGraph();
 		Map<Set<Vertex>, String> groupLabel = new HashMap<>();
@@ -309,7 +308,7 @@ public final class Graph extends Storage {
 		}
 
 		// construct graph of disjoint choices
-		AbstractGraph h = moduleGroups(s, g);
+		AbstractGraph h = moduleGroups(s);
 		System.out.println(
 			"\n\nGraph of disjoint choices constructed:");
 		GraphAlgorithms.printGraph(h);
-- 
cgit v1.2.3