Add bipartite graph check implmentation

Author: kaidul

README.md

@@ -47,6 +47,7 @@
 + [Floyd Warshall’s](algorithms/floyd_warshall.cpp)
 + [Loop Detection](algorithms/topsort.cpp)
 + [Topological Sort](algorithms/topsort.cpp)
++ [Bipartite Graph Check](algorithms/bipartite_graph_check.cpp)
 + [Strongly Connected Component (Kosaraju)](algorithms/scc.cpp)
 + [Lowest Common Ancestor(sparse table)](algorithms/lca.cpp)
 + [Articulation Point](algorithms/articulation_point.cpp)

algorithms/bipartite_graph_check.cpp

@@ -0,0 +1,35 @@
+#include <vector>
+#include <array>
+#include <queue>
+
+using namespace std;
+
+#define MAX 100000
+
+vector<int> adj[MAX];
+array<int, MAX> color;
+array<bool, MAX> visited;
+
+bool isGraphBipartite(int src) {
+  color.fill(-1);
+  visited.fill(false);
+  queue<int> Q;
+  Q.push(src);
+  color[src] = 1;
+  visited[src] = true;
+  while (!Q.empty()) {
+    int u = Q.front();
+    Q.pop();
+    for (int i = 0; i < (int)adj[u].size(); i++) {
+      int v = adj[u][i];
+      if (!visited[v]) {
+        visited[v] = true;
+        color[v] = 1 - color[u];
+        Q.push(v);
+      } else if (visited[v] and color[v] == color[u]) {
+        return false;
+      }
+    }
+  }
+  return true;
+}