|Perl Monk, Perl Meditation
Re^2: Undirected Weighted Graphsby OverlordQ (Hermit)
|on Apr 07, 2009 at 22:05 UTC
That sounds almost exactly what I'm looking at. Each zone has a series of jumpgates in 3D space that link to another jumpgate in another zone. On first glance you'd think that you'd just represent each zone as a node in the graph but then you'd come to realize there's no way to calculate the non-zero distance between gates in the same zone.
You doing yours for a game of sorts or something completely different.