make methods AbstractGraph() and demo() and function solveManyTimes() private

1 files changed, 3 insertions, 3 deletions

diff --git a/src/dk.biks.bachelorizer/dk/biks/bachelorizer/Graph.java b/src/dk.biks.bachelorizer/dk/biks/bachelorizer/Graph.java
index 303a4a0..23f4819 100644
--- a/src/dk.biks.bachelorizer/dk/biks/bachelorizer/Graph.java
+++ b/src/dk.biks.bachelorizer/dk/biks/bachelorizer/Graph.java
@@ -186,7 +186,7 @@ public final class Graph extends Storage {
 	///
 	/// @param sets  list of disjoint choices
 	/// @return      groups of disjoint choices as a graph
-	public AbstractGraph moduleGroups(
+	private AbstractGraph moduleGroups(
 		final ArrayList<Set<Vertex>> sets
 	) {
 		AbstractGraph h = new AdjListGraph();
@@ -249,7 +249,7 @@ public final class Graph extends Storage {
 	///
 	/// @param g  sets of disjoint choices as a graph
 	/// @return   best path among many random ones
-	public static int solveManyTimes(final AbstractGraph g) {
+	private static int solveManyTimes(final AbstractGraph g) {
 		// number higher than total students
 		int bestPathCost = Integer.MAX_VALUE;
 		for (int i = 0; i < DEMO_ITERATIONS; i++) {
@@ -280,7 +280,7 @@ public final class Graph extends Storage {
 	}
 
 	/// Demo function to solve assignment
-	public void demo() {
+	private void demo() {
 
 		System.out.println("\n\nGraph of choices constructed:");
 		GraphAlgorithms.printGraph(g);