Warning! It seems that you are using Dodona within another webpage, so not everything may work properly. Let your teacher know so that he can solve the problem by adjusting a setting in the learning environment. In the meantime, you can click this link to open Dodona in a new window.
Warning! The page was not fully loaded, probably because of a network issue. It could be that not all functionalities work as expected. Please try reloading the page.
Dijkstra's shortest path algorithm
Sign in to test your solution.
import heapq
from functools import total_ordering
@total_ordering
class SpecialSorted:
def __init__(self, element, value):
self.element = element
self.value = value
def __eq__(self, other):
return self.value == other.value
def __ne__(self, other):
return self.value != other.value
def __lt__(self, other):
return self.value < other.value
class PriorityQueue:
def __init__(self, sortkey = lambda x : x):
self.content = []
self.sortkey = sortkey
def add(self, item):
heapq.heappush(self.content, SpecialSorted(item, self.sortkey(item)))
def peek(self):
return self.content[0].element if self.content else None
def poll(self):
return heapq.heappop(self.content).element if len(self.content) > 0 else None
def is_empty(self):
return len(self.content) == 0
def __str__(self):
return str(heapq.nsmallest(len(self.content), [item.element for item in self.content]))