Merge pull request #132 from yuvaraja99/patch-3

Created is-graph-bipartite.cpp

is-graph-bipartite.cpp

@@ -0,0 +1,28 @@
+// Check if a graph is bipartite or not
+//BFS Solution
+
+class Solution {
+public:
+    bool isBipartite(vector<vector<int>>& graph) {
+        unordered_map<int, int> color;
+        for (int node = 0; node < graph.size(); ++node) {
+            if (color.count(node)) {
+                continue;
+            }
+            vector<int> stack{node};
+            color[node] = 0;
+            while (!stack.empty()) {
+                int curr = stack.back(); stack.pop_back();
+                for (const auto& neighbor : graph[curr]) {
+                    if (!color.count(neighbor)) {
+                        stack.emplace_back(neighbor);
+                        color[neighbor] = color[curr] ^ 1;
+                    } else if (color[neighbor] == color[curr]) {
+                        return false;
+                    }
+                }
+            }
+        }
+        return true;
+    }
+};