clean up Fusion_Graph and fix get_path
parent
20e24a40e3
commit
2f2c281265
|
@ -15,7 +15,7 @@ import sys
|
|||
|
||||
class Game:
|
||||
|
||||
def __init__(self, vanillaGame, randoSettings = (None,)):
|
||||
def __init__(self, vanillaGame, randoSettings=None):
|
||||
self.graph = dict()
|
||||
self.areaConnections = dict()
|
||||
self.areaConnectionOffsets = dict()
|
||||
|
@ -50,7 +50,7 @@ class Game:
|
|||
sourceDoor = int.from_bytes(sourceRom.read(1), 'little')
|
||||
targetOffset = sourceRom.tell()
|
||||
targetArea = int.from_bytes(sourceRom.read(1), 'little')
|
||||
if sourceArea != 255:
|
||||
while sourceArea != 255:
|
||||
self.areaConnections.update({
|
||||
'S{}-{:02X}'.format(sourceArea, sourceDoor): targetArea })
|
||||
self.areaConnectionOffsets.update({
|
||||
|
@ -91,7 +91,7 @@ class Game:
|
|||
doorString]
|
||||
doorNumber += 1
|
||||
# print('DEBUG: Parsing seemingly done?')
|
||||
except:
|
||||
except FileNotFoundError:
|
||||
print('Error:', vanillaGame, 'could not be opened.')
|
||||
sys.exit(1)
|
||||
|
||||
|
@ -212,32 +212,32 @@ class Game:
|
|||
checkRequirement = (start, end)
|
||||
return self.requirements.get(checkRequirement)
|
||||
|
||||
def get_path(self, start, end, LimitArea, path, depth = (False, None, 100)):
|
||||
def get_path(self, start, end, LimitArea=False, path=None, depth=100):
|
||||
if path == None:
|
||||
self.visited.clear()
|
||||
self.queue.clear()
|
||||
path = list()
|
||||
path = path + [
|
||||
start]
|
||||
path = path + [start]
|
||||
if start not in self.graph:
|
||||
return None
|
||||
if None == end:
|
||||
if start == end:
|
||||
return path
|
||||
# if None(path) >= depth:
|
||||
if path >= depth:
|
||||
if len(path) >= depth:
|
||||
return None
|
||||
for point in None.graph[start]:
|
||||
if point in self.itemLocations and point not in end:
|
||||
for point in self.graph[start]:
|
||||
if point in self.itemLocations:
|
||||
if point not in end:
|
||||
continue
|
||||
if point in path:
|
||||
continue
|
||||
if LimitArea:
|
||||
for area in range(0, 7):
|
||||
if 'S{}'.format(area) in start and 'S{}'.format(area) not in point:
|
||||
if 'S{}'.format(area) in start:
|
||||
if 'S{}'.format(area) not in point:
|
||||
return None
|
||||
edge = (start, point)
|
||||
self.queue.append(edge)
|
||||
if self.queue:
|
||||
while self.queue:
|
||||
edge = self.queue.pop()
|
||||
if edge not in self.visited:
|
||||
self.visited.append(edge)
|
||||
|
@ -246,14 +246,10 @@ class Game:
|
|||
if pathReqs == None:
|
||||
newpath = self.get_path(node, end, LimitArea, path, depth)
|
||||
if newpath:
|
||||
path = path + [
|
||||
node]
|
||||
path = path + [node]
|
||||
return newpath
|
||||
if pathReqs == True:
|
||||
elif pathReqs == True:
|
||||
newpath = self.get_path(node, end, LimitArea, path, depth)
|
||||
if newpath:
|
||||
path = path + [
|
||||
node]
|
||||
path = path + [node]
|
||||
return newpath
|
||||
|
||||
|
||||
|
|
Loading…
Reference in New Issue