-
Notifications
You must be signed in to change notification settings - Fork 0
/
Greedy.py
43 lines (32 loc) · 1.38 KB
/
Greedy.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
import heapq
class Greedy:
def Search(self, root, goaly, goalx):
open=[]
heapq.heapify(open)
close = dict()
pathToSolve = list()
heapq.heappush(open,(root.HU,root))
close[root.location] = True
while (not len(open) == 0):
currrentNode1 = heapq.heappop(open)
currrentNode=currrentNode1[1]
currrentNode.ExpandMove()
if (currrentNode.isGoal(goalx, goaly)):
self.findpath(currrentNode, pathToSolve)
return pathToSolve
for i in range(len(currrentNode.childerin)):
if (currrentNode.childerin[i].isGoal(goalx, goaly)):
self.findpath(currrentNode, pathToSolve)
return pathToSolve
try:
if not close[currrentNode.childerin[i].location]:
print()
except KeyError:
heapq.heappush(open,(currrentNode.childerin[i].HU,currrentNode.childerin[i]))
close[currrentNode.childerin[i].location] = True
def findpath(self, go, lis=[]):
c = go
lis.append(c)
while (not c.pirent == None):
c = c.pirent
lis.append(c)