Fixed graph conflicts logic

inclement · inclement · commit 514571a82120 · 2016-02-14T22:20:09.000Z
diff --git a/pythonforandroid/graph.py b/pythonforandroid/graph.py
@@ -60,10 +60,11 @@ def _add(self, graph, dependent, dependency):
 
     def conflicts(self, conflict):
         graphs = self.graphs
+        initial_num = len(graphs)
         for i in range(len(graphs)):
-            graph = graphs[len(graphs) - 1 - i]
+            graph = graphs[initial_num - 1 - i]
             if conflict in graph:
-                graphs.pop(len(graphs) - 1 - i)
+                graphs.pop(initial_num - 1 - i)
         return len(graphs) == 0
 
     def remove_remaining_conflicts(self, ctx):
