Make a DOT graph of Colossal Cave.
-a = emit graph of entire dungeon
--d = emit graoh of mazw all different
+-d = emit graph of maze all different
-f = emit graph of forest locations
-m = emit graph of maze all alike
-s = emit graph of non-forest surface locations
# Copyright (c) 2017 by Eric S. Raymond
# SPDX-License-Identifier: BSD-2-clause
-# pylint: disable=consider-using-f-string
+# pylint: disable=consider-using-f-string,line-too-long,invalid-name,missing-function-docstring,multiple-imports,redefined-outer-name
import sys, getopt, yaml
return description
# A forwarder is a location that you can't actually stop in - when you go there
-# it ships some message (which is the point) then shifts you to a nexr location.
+# it ships some message (which is the point) then shifts you to a next location.
# A forwarder has a zero-length array of notion verbs in its travel section.
#
# Here is an example forwarder declaration:
return loc
def reveal(objname):
- "Should this object be revealed when mappinmg?"
+ "Should this object be revealed when mapping?"
if "OBJ_" in objname:
return False
if objname == "VEND":
startlocs[location] = [objname]
# Compute reachability, using forwards.
- # Dictionary ke6y is (from, to) iff its a valid link,
- # value is correspoinding motion verbs.
+ # Dictionary key is (from, to) iff its a valid link,
+ # value is corresponding motion verbs.
links = {}
nodes = []
for (loc, attrs) in db["locations"]: