add: BipartiteGraphValidation

Author: Jer3myYu

java/Graphs/BipartiteGraphValidation.java

@@ -0,0 +1,29 @@
+public class BipartiteGraphValidation {
+    public boolean bipartiteGraphValidation(int[][] graph) {
+        int[] colors = new int[graph.length];
+        // Determine if each graph component is bipartite.
+        for (int i = 0; i < graph.length; i++) {
+            if (colors[i] == 0 && !dfs(i, 1, graph, colors)) {
+                return false;
+            }
+        }
+        return true;
+    }
+
+    private boolean dfs(int node, int color, int[][] graph, int[] colors) {
+        colors[node] = color;
+        for (int neighbor : graph[node]) {
+            // If the current neighbor has the same color as the current 
+            // node, the graph is not bipartite.
+            if (colors[neighbor] == color) {
+                return false;
+            }
+            // If the current neighbor is not colored, color it with the 
+            // other color and continue the DFS.
+            if (colors[neighbor] == 0 && !dfs(neighbor, -color, graph, colors)) {
+                return false;
+            }
+        }
+        return true;
+    }
+}