Добавлены юнит тесты

Author: thehighestmath

build/libs/SummerPractice-all-1.0-SNAPSHOT.jar

@@ -24,10 +24,10 @@ public Graph() {
         this.inputVertices = new LinkedList<>();
     }
 
-//    public void initGraph(List<Edge> inputEdges, List<Node> inputVertices) {
-//        this.inputEdges = new LinkedList<>(inputEdges);
-//        this.inputVertices = new LinkedList<>(inputVertices);
-//    }
+    public void initGraph(List<Edge> inputEdges, List<Node> inputVertices) {
+        this.inputEdges = new LinkedList<>(inputEdges);
+        this.inputVertices = new LinkedList<>(inputVertices);
+    }
 
     public void addEdge(Node from, Node to, int distance) {
         Edge newEdge = new Edge(from, to, distance);

src/main/java/ru/etu/practice/Graph.java

@@ -13,7 +13,7 @@ public List<Edge> getInputEdges() {
     }
 
     private List<Edge> inputEdges;
-    private final List<Node> inputVertices;
+    private List<Node> inputVertices;
     private final List<Edge> outputEdges;
     private final List<Set<Node>> outputVertices;
 
@@ -27,6 +27,12 @@ public Kruskal() {
         outputVertices = new LinkedList<>();
     }
 
+    public void initKruskal(List<Edge> inputEdges, List<Node> inputVertices) {
+        this.inputEdges = inputEdges;
+        this.inputVertices = inputVertices;
+        this.graph.initGraph(inputEdges, inputVertices);
+    }
+
     public void sortEdges() {
         inputEdges = new LinkedList<>(graph.getInputEdges());
         inputEdges.sort(new Comparator<Edge>() {