Mapping improvements.
This commit is contained in:
parent
0f5fd82b77
commit
ad75cc1eb7
3 changed files with 78 additions and 15 deletions
|
@ -1,15 +1,29 @@
|
|||
#!/usr/bin/env python3
|
||||
"""\
|
||||
usage: make-graph.py [-a] [-m] [-s]
|
||||
|
||||
# Make a DOT graph of the dungeon
|
||||
#
|
||||
Make a DOT graph of Colossal Cave
|
||||
|
||||
-a = emit graph of entire dungeon
|
||||
-m = emit graph of maze all alike
|
||||
-s = emit graph of surface locations
|
||||
"""
|
||||
# Copyright (c) 2017 by Eric S. Raymond
|
||||
# SPDX-License-Identifier: BSD-2-clause
|
||||
|
||||
import sys, yaml
|
||||
import sys, yaml, getopt
|
||||
|
||||
def allalike(loc, dest):
|
||||
def allalike(loc):
|
||||
"Select out loci related to the Maze All Alike"
|
||||
return ("ALIKE" in loc) or ("MAZEEND" in loc) or ("STALACTITE" in loc) or (loc == "LOC_MISTWEST" and "ALIKE" in dest)
|
||||
return ("ALIKE" in loc) or (loc == "LOC_PITBRINK") or ("MAZEEND" in loc) or ("STALACTITE" in loc) or (loc == "LOC_MISTWEST")
|
||||
|
||||
def surface(attrs):
|
||||
"Select out surface locations"
|
||||
if ("ABOVE" in attrs["conditions"]) and attrs["conditions"]["ABOVE"]:
|
||||
return True
|
||||
if ("FOREST" in attrs["conditions"]) and attrs["conditions"]["FOREST"]:
|
||||
return True
|
||||
return False
|
||||
|
||||
def abbreviate(d):
|
||||
m = {"NORTH":"N", "EAST":"E", "SOUTH":"S", "WEST":"W", "UPWAR":"U", "DOWN":"D"}
|
||||
|
@ -19,8 +33,59 @@ if __name__ == "__main__":
|
|||
with open("adventure.yaml", "r") as f:
|
||||
db = yaml.safe_load(f)
|
||||
|
||||
try:
|
||||
(options, arguments) = getopt.getopt(sys.argv[1:], "ams")
|
||||
except getopt.GetoptError as e:
|
||||
print(e)
|
||||
sys.exit(1)
|
||||
|
||||
subset = "maze"
|
||||
for (switch, val) in options:
|
||||
if switch == '-a':
|
||||
subset = "all"
|
||||
elif switch == '-m':
|
||||
subset = "maze"
|
||||
elif switch == '-s':
|
||||
subset = "surface"
|
||||
else:
|
||||
sys.stderr.write(__doc__)
|
||||
raise SystemExit(1)
|
||||
|
||||
startlocs = {}
|
||||
for obj in db["objects"]:
|
||||
objname = obj[0]
|
||||
location = obj[1].get("locations")
|
||||
if "OBJ" not in objname and location != "LOC_NOWHERE" and ("immovable" not in obj[1] or not obj[1]["immovable"]):
|
||||
if location in startlocs:
|
||||
startlocs[location].append(objname)
|
||||
else:
|
||||
startlocs[location] = [objname]
|
||||
|
||||
startlocs = {}
|
||||
for obj in db["objects"]:
|
||||
objname = obj[0]
|
||||
location = obj[1].get("locations")
|
||||
if "OBJ" not in objname and location != "LOC_NOWHERE" and ("immovable" not in obj[1] or not obj[1]["immovable"]):
|
||||
if location in startlocs:
|
||||
startlocs[location].append(objname)
|
||||
else:
|
||||
startlocs[location] = [objname]
|
||||
|
||||
print("digraph G {")
|
||||
for (loc, attrs) in db["locations"]:
|
||||
|
||||
for (loc, attrs) in db["locations"]:
|
||||
if subset == "surface" and not surface(attrs):
|
||||
continue
|
||||
if subset == "maze" and not allalike(loc):
|
||||
continue;
|
||||
node_label = loc[4:]
|
||||
if loc in startlocs:
|
||||
node_label += "\\n" + ",".join(startlocs[loc]).lower()
|
||||
print(' %s [shape=box,label="%s"]' % (loc[4:], node_label))
|
||||
|
||||
for (loc, attrs) in db["locations"]:
|
||||
if subset == "surface" and not surface(attrs):
|
||||
continue
|
||||
travel = attrs["travel"]
|
||||
if len(travel) > 0:
|
||||
for dest in travel:
|
||||
|
@ -30,7 +95,7 @@ if __name__ == "__main__":
|
|||
action = dest["action"]
|
||||
if action[0] == "goto":
|
||||
dest = action[1]
|
||||
if not allalike(loc, dest):
|
||||
if subset == "maze" and not (allalike(loc) or allalike(dest)):
|
||||
continue;
|
||||
arc = "%s -> %s" % (loc[4:], dest[4:])
|
||||
label=",".join(verbs).lower()
|
||||
|
@ -38,5 +103,3 @@ if __name__ == "__main__":
|
|||
arc += ' [label="%s"]' % label
|
||||
print(" " + arc)
|
||||
print("}")
|
||||
|
||||
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue