You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
47 lines
1.1 KiB
47 lines
1.1 KiB
class Node():
|
|
def __init__(self, state, parent, action):
|
|
self.state = state
|
|
self.parent = parent
|
|
self.action = action
|
|
|
|
def draw_path(self):
|
|
path = []
|
|
node = self
|
|
while node.parent:
|
|
path.append((node.action, node.state))
|
|
node = node.parent
|
|
path.reverse()
|
|
return path
|
|
|
|
class StackFrontier():
|
|
def __init__(self):
|
|
self.frontier = []
|
|
|
|
def add(self, node):
|
|
self.frontier.append(node)
|
|
|
|
def contains_state(self, state):
|
|
return any(node.state == state for node in self.frontier)
|
|
|
|
def empty(self):
|
|
return len(self.frontier) == 0
|
|
|
|
def remove(self):
|
|
if self.empty():
|
|
raise Exception("empty frontier")
|
|
else:
|
|
node = self.frontier[-1]
|
|
self.frontier = self.frontier[:-1]
|
|
return node
|
|
|
|
|
|
|
|
class QueueFrontier(StackFrontier):
|
|
|
|
def remove(self):
|
|
if self.empty():
|
|
raise Exception("empty frontier")
|
|
else:
|
|
node = self.frontier[0]
|
|
self.frontier = self.frontier[1:]
|
|
return node
|