Code cleanup.

jwasham · jwasham · commit 6816597f751a · 2016-08-02T21:11:08.000-07:00
diff --git a/graphs/undirected_graph_matrix.py b/graphs/undirected_graph_matrix.py
@@ -102,26 +102,24 @@ def bfs(self):
     def is_bipartite(self):
         """
         Returns true if graph is bipartite
-        :return:
+        :rtype: bool
         """
-        is_bipartite = True
         colorings = {}
         to_visit = queue.Queue()
         to_visit.put(0)
         colorings[0] = 0
 
-        while not to_visit.empty() and is_bipartite:
+        while not to_visit.empty():
             v = to_visit.get()
 
             for u in self.get_neighbor(v):
                 if u not in colorings:
                     colorings[u] = 1 - colorings[v]
                     to_visit.put(u)
                 elif colorings[u] == colorings[v]:
-                    is_bipartite = False
-                    break
+                    return False
 
-        return is_bipartite
+        return True
 
 
 def get_test_graph_1():
