-
Notifications
You must be signed in to change notification settings - Fork 0
/
Graph.py
65 lines (50 loc) · 1.3 KB
/
Graph.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
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
from abc import ABC, abstractmethod
#
# Implements basic data structures necessary to implement
# search algorithms
#
class Node:
def __init__(self,state,father_node):
self.state = state
self.father_node = father_node
if self.father_node == None:
self.depth = 0
self.g = 0
else:
self.depth = father_node.depth + 1
self.g = state.cost() + self.father_node.g
def show_path(self):
if self.father_node != None:
return self.father_node.show_path() + " ; " + self.state.operator
else:
return self.state.operator
def h(self):
return self.state.h()
def f(self):
#f(n) = g(n) + h(n)
return self.g + self.h()
def best_nextState(self, neighbours):
best = neighbours[0]
for i in neighbours:
if i < best:
best = i
return best
class State(ABC):
@abstractmethod
def sucessors(self):
pass
@abstractmethod
def is_goal(self):
pass
@abstractmethod
def description(self):
pass
@abstractmethod
def cost(self):
pass
@abstractmethod
def print(self):
pass
@abstractmethod
def env(self):
pass