Heapsort, Heap, Data Structures, Python, Sorting Algorithms.
len(connections): connection, minDistance = self.__getMinimumDistance(distances, visited) if minDistance == float("inf"): break visited.add(connection) for destination, distance in connections[connection].items(): newDistance = minDistance + distance currentDistance = distances[destination] if