Merge branch 'feature/graph-prim' into develop

Author: codejsha

java-algorithm/src/main/java/com/example/algorithm/graph/Prim.java

@@ -1,5 +1,7 @@
 package com.example.algorithm.graph;
 
+import com.google.common.base.Objects;
+
 import java.util.HashSet;
 import java.util.LinkedHashSet;
 import java.util.PriorityQueue;
@@ -126,13 +128,32 @@ public void addEdge(Edge edge) {
         }
     }
 
-    public static class Vertex {
+    public static class Vertex implements Comparable<Vertex> {
         char key;
         Set<Edge> edges = new HashSet<>();
 
         public Vertex(char key) {
             this.key = key;
         }
+
+        @Override
+        public int compareTo(Vertex other) {
+            return Character.compare(this.key, other.key);
+        }
+
+        @Override
+        public boolean equals(Object o) {
+            if (this == o) return true;
+            if (o == null || getClass() != o.getClass()) return false;
+            Vertex vertex = (Vertex) o;
+            return key == vertex.key
+                    && Objects.equal(edges, vertex.edges);
+        }
+
+        @Override
+        public int hashCode() {
+            return Objects.hashCode(key);
+        }
     }
 
     public static class Edge implements Comparable<Edge> {
@@ -148,7 +169,22 @@ public Edge(Vertex source, Vertex sink, int weight) {
 
         @Override
         public int compareTo(Edge other) {
-            return Integer.compare(weight, other.weight);
+            return Integer.compare(this.weight, other.weight);
+        }
+
+        @Override
+        public boolean equals(Object o) {
+            if (this == o) return true;
+            if (o == null || getClass() != o.getClass()) return false;
+            Edge edge = (Edge) o;
+            return weight == edge.weight
+                    && Objects.equal(source, edge.source)
+                    && Objects.equal(sink, edge.sink);
+        }
+
+        @Override
+        public int hashCode() {
+            return Objects.hashCode(source, sink, weight);
         }
     }
 }

java-algorithm/src/test/java/com/example/algorithm/graph/PrimTest.java

@@ -4,7 +4,9 @@
 import org.junit.jupiter.api.BeforeEach;
 import org.junit.jupiter.api.Test;
 
-import static org.junit.jupiter.api.Assertions.assertArrayEquals;
+import java.util.Arrays;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 class PrimTest {
     Prim.Graph graph;
@@ -69,14 +71,22 @@ void tearDown() {
     @Test
     void primAlgorithmVertex() {
         var expected = new Prim.Vertex[]{vertexA, vertexB, vertexC, vertexI, vertexF, vertexG, vertexH, vertexD, vertexE};
-        var actual = Prim.primAlgorithmVertex(graph, vertexA);
-        assertArrayEquals(expected, actual);
+        var vertices = Prim.primAlgorithmVertex(graph, vertexA);
+        Arrays.sort(expected);
+        Arrays.sort(vertices);
+        for (int i = 0; i < expected.length; i++) {
+            assertEquals(expected[i].key, vertices[i].key);
+        }
     }
 
     @Test
     void primAlgorithmEdge() {
         var expected = new Prim.Edge[]{edgeAB, edgeBC, edgeCI, edgeCF, edgeFG, edgeGH, edgeCD, edgeDE};
-        var actual = Prim.primAlgorithmEdge(graph, vertexA);
-        assertArrayEquals(expected, actual);
+        var edges = Prim.primAlgorithmEdge(graph, vertexA);
+        Arrays.sort(expected);
+        Arrays.sort(edges);
+        for (int i = 0; i < expected.length; i++) {
+            assertEquals(expected[i].weight, edges[i].weight);
+        }
     }
 }