-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathfrontier.py
38 lines (27 loc) · 817 Bytes
/
frontier.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
from collections import deque
from heapq import *
class Queue:
def __init__(self, *elements):
self._elements = deque(elements)
self._maxSize = len(self._elements)
def __len__(self):
return len(self._elements)
def push(self, element):
self._elements.append(element)
self._maxSize = max(self._maxSize, len(self._elements))
def pop(self):
return self._elements.popleft()
def max(self):
return self._maxSize
class Stack(Queue):
def pop(self):
return self._elements.pop()
class Heap:
def __init__(self):
self._elements = []
def __len__(self):
return len(self._elements)
def push(self, element):
heappush(self._elements, element)
def pop(self):
return heappop(self._elements)