Hello, I'm looking for an algorithm to project "MUD maps" such as the following map: http://www.aww-mud.org/maps/MUD_Maps/Caerin-colour.jpg
MUD:s consists of rooms, each rooms has up to four orthogonal edges (north, east, west and south) that connects it to another room. So it is very easy to model a MUD as a directed graph. But projecting the graph on a surface is very complicated. For example, Room A:s North edge may connect it to Room B. But Room B:s South edge may connect it to Room C. Or another tricky example: Room A:s East edge connects it to Room B, whose East edge connect it to Room C, whose North edge connects it to Room D, whose West edge connects it to Room E, whose South edge connects it to Room A. In that example, there would be a "hole" between Room D and E. -- mvh Björn -- http://mail.python.org/mailman/listinfo/python-list
