Is graph bipartite

Author: ivanmmarkovic

graphs/is-graph-bipartite/__pycache__/graph.cpython-38.pyc

@@ -0,0 +1,42 @@
+from queue import Queue
+
+
+class Graph:
+    def __init__(self):
+        self._vertices: list = []
+        self._colors: dict = {}
+        self._adjacency_matrix: dict = {}
+
+    def add_vertex(self, label: str):
+        self._vertices.append(label)
+        self._colors[label] = None
+        self._adjacency_matrix[label]: list = []
+
+    def add_edge(self, label1: str, label2: str):
+        self._adjacency_matrix[label1].append(label2)
+        self._adjacency_matrix[label2].append(label1)
+
+    def bipartite_check(self) -> bool:
+        for vertex in self._vertices:
+            if self._colors[vertex] is not None:
+                continue
+            self._colors[vertex] = "red"
+            q: Queue = Queue()
+            q.enqueue(vertex)
+            while not q.is_empty():
+                v = q.dequeue()
+                for neighbour in self._adjacency_matrix[v]:
+                    if self._colors[neighbour] == self._colors[v]:
+                        return False
+                    if self._colors[neighbour] is None:
+                        if self._colors[v] == "red":
+                            self._colors[neighbour] = "blue"
+                        else:
+                            self._colors[neighbour] = "red"
+                        q.enqueue(neighbour)
+        return True
+
+
+
+
+

graphs/is-graph-bipartite/__pycache__/queue.cpython-38.pyc

@@ -0,0 +1,22 @@
+from graph import Graph
+
+
+g: Graph = Graph()
+g.add_vertex("a")
+g.add_vertex("b")
+g.add_vertex("c")
+g.add_vertex("d")
+
+# a, b ||---|| c, d
+
+
+g.add_edge("a", "c")
+g.add_edge("a", "d")
+
+g.add_edge("b", "c")
+g.add_edge("b", "d")
+
+
+# g.add_edge("a", "b")
+
+print(g.bipartite_check())

graphs/is-graph-bipartite/graph.py

@@ -0,0 +1,14 @@
+class Queue:
+    def __init__(self):
+        self._queue: list = []
+
+    def is_empty(self) -> bool:
+        return len(self._queue) == 0
+
+    def enqueue(self, vertex: str):
+        self._queue.append(vertex)
+
+    def dequeue(self):
+        if self.is_empty():
+            raise Exception("Queue is empty")
+        return self._queue.pop(0)