aboutsummaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorIan Valentin Christensen <valentianchristensen@gmail.com>2025-04-29 12:52:55 +0200
committerIan Valentin Christensen <valentianchristensen@gmail.com>2025-04-29 12:56:05 +0200
commitd2a7db8a16bcc97a720a3721a1888c59e80f2f34 (patch)
treee9040419a16b940f91c3299a86cdf71961125b77
parentbf171ed452f4c686ffbf3cab5d966e3b115d2f30 (diff)
fix brutally embarassing errorsAnd typos
-rw-r--r--src/dk.biks.bachelorizer/dk/biks/bachelorizer/Graph.java7
1 files changed, 4 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 9d8e12f..8782569 100644
--- a/src/dk.biks.bachelorizer/dk/biks/bachelorizer/Graph.java
+++ b/src/dk.biks.bachelorizer/dk/biks/bachelorizer/Graph.java
@@ -7,6 +7,8 @@ import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.HashSet;
+import java.util.HashMap;
+import java.util.Map;
import java.util.List;
import java.util.Set;
import java.util.stream.Collectors;
@@ -219,15 +221,14 @@ public final class Graph {
final ArrayList<Set<Vertex>> sets, final AbstractGraph g
) {
AbstractGraph h = new AdjListGraph();
- Map<Set<Vertex>, String> label = new Map<>();
+ Map<Set<Vertex>, String> label = new HashMap<>();
for (Set<Vertex> groupSet : sets) {
// canonical string name - strings sortes alphabetically
String name = groupSet.stream()
.map(Vertex::toString)
.sorted() // avoid differently sorted duplicates
- .collect(Collecters.joining(",", "{", "}"));
+ .collect(Collectors.joining(",", "{", "}"));
label.put(groupSet, name);
- h.insertVertex(name);
}
for (Set<Vertex> s: sets) {