CS Fun A - Ivana

graphs/possible_bipartition.py

@@ -8,5 +8,26 @@ def possible_bipartition(dislikes):
         Time Complexity: ?
         Space Complexity: ?
     """
-    pass
 
+    visited_nodes = {}
+    queue = []
+
+    # Iterate through the keys in dislikes
+    for dog in dislikes.keys():
+        if dog not in visited_nodes:
+            queue.append(dog)
+            visited_nodes[dog] = 0
+
+        while queue:
+            current = queue.pop(0)
+
+            # Iterate through the neighbors of current node
+            for neighbor in dislikes[current]:
+                if neighbor not in visited_nodes:
+                    queue.append(neighbor)
+                    visited_nodes[neighbor] = visited_nodes[current] + 1
+                elif visited_nodes[neighbor] == visited_nodes[current]:
+                    return False
+
+    return True
+