On Thu, 29 Nov 2001, Nicholas E. Walker wrote: > You'd probably be best off using a spanning-tree algorithm. Perhaps also Dijkstras algorithm could be used? Brgds, Marcus _______________________________________________ MUD-Dev mailing list MUD-Dev at kanga.nu https://www.kanga.nu/lists/listinfo/mud-dev