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.
Python exercise
Parking simulator
Sign in to hand in your solution and get feedback.
import heapq
class PriorityQueue:
def __init__(self):
self.content = []
def add(self, item):
heapq.heappush(self.content, item)
def peek(self):
return self.content[0]
def poll(self):
return heapq.heappop(self.content) 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), self.content))
def simuleer_parking(plaatsen, bloktijd, klanten):
pass