User:Keiji/aystar.py: Difference between revisions
m
__item__ -> __getitem__
(UNTESTED A* algorithm based on wikipedia's pseudocode.) |
m (__item__ -> __getitem__) |
||
| (One intermediate revision by the same user not shown) | |||
Line 31:
self.blen = len(self.back)
def
return self.fore[index]
def find(self, item):
if (item < 0) or (item >= self.blen):
return -1
return self.back[item]
def pop(self, index=-1):
Line 165:
f_score[y] = g_score[y] + h_score[y]
pos = bsearch(openset, y, True, f_score.
openset.insert(pos, y)
return None
| |||