Graph library - removed useless condition

Piratmac · Piratmac · commit 2ad007e78b3d · 2021-12-27T00:09:04.000+01:00
diff --git a/2021/graph.py b/2021/graph.py
@@ -386,10 +386,7 @@ def dijkstra(self, start, end=None):
                     continue
 
                 # Adding for future examination
-                if type(neighbor) == complex:
-                    heapq.heappush(frontier, (current_distance + weight, neighbor))
-                else:
-                    heapq.heappush(frontier, (current_distance + weight, neighbor))
+                heapq.heappush(frontier, (current_distance + weight, neighbor))
 
                 # Adding for final search
                 self.distance_from_start[neighbor] = current_distance + weight
