Graph library - removed useless condition

Author: Piratmac

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