Diez B. Roggisch wrote:
> But there is no cookbook-algorithm that will produce perfect MUD-maps. For
> such a beast, you have to cough up one on your own, with things like
> constraint solvers and the like. Certainly over _my_ head, at least without
> deep studies of planar graph representation problems.
To convince yourself of this, here is a small problem
that does not flatten to any simple 2-D solution.
Consider :
A, B, C
a, b, c
A.south, B.South, C.south = a, b, c
a.north, b.north, c.north = A, B, C
A.east, B.east, C.east = a, b, c
a.west, b.west, c.west = A, B, C
a.east, b.east, c.east = A, B, C
A.west, B.west, C.west = a, b, c
--
--Scott David Daniels
[EMAIL PROTECTED]
--
http://mail.python.org/mailman/listinfo/python-list
