Imperial Crossroads #Gate 1 Great Pillars #Zone Octavius #Faction Great Pillars #Zone Great Pillars Station #Gate 2 13282 #Distance from Gate 1 to Gate 2 in Zone
Dark Fork #G1 Imperial Crossroads #Zone Octavius #Faction Imperial Crossroads #Zone Great Pillars #G2 32660 ...Distance between Imperial Crossroads in Great Pillars and Great Pillars in Imperial Crossroads is 0 (Wormhole,Jumpgate,Magic,etc).
Eventual target is to create a weighted undirected graph for creation and application of shortest path algorithm on an undirected graph.
Are there any suggestions on a temporary storage structure or just read/slurp and shove it into Graph as it gets the data?
The idea I envisioned would it would create nodes based on a concatenation of Zone and Gate so as to handle the zero distance condition I mentioned above as then all combinations of FooBar and BarFoo would have a distance of zero.
Or would you suggest a different module/idea all together?
In reply to Undirected Weighted Graphs by OverlordQ
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |