Pages: [1] :: one page |
|
Author |
Thread Statistics | Show CCP posts - 0 post(s) |
Myopic Thyne
|
Posted - 2009.08.09 09:33:00 -
[1]
I'm looking to, instead of calculating how far it is from SystemX to SystemY to instead show all systems n jumps from SystemX, is there a lib out there for use with .net or that can accept localhost connections for this kind of request?
Thanks much.
|
Arous Drephius
|
Posted - 2009.08.09 09:59:00 -
[2]
No idea if there's a library or anything that can do this for you, but it's pretty simple to calculate it yourself.
1. Find all the systems one jump from SystemX and add them to your list. 2. Find all the systems one jump from every system on the list other than SystemX. 3. Repeat until you have executed your search n times.
|
Myopic Thyne
|
Posted - 2009.08.09 10:20:00 -
[3]
I can find the distances in the EVE core dump can't I?
|
Mark Galean
Mercurialis Inc. Wildly Inappropriate.
|
Posted - 2009.08.09 12:07:00 -
[4]
All (well, most) static data is in the database dumps, including XYZ coordinates, systemlinks, regional links etc. Short answer: yes, check the map* tables in the database - the rest is using Pythagoras in a 3D matrix --
Mark Galean, Mercurial Inc. Wildly Inappropriate. (WI.) |
Arous Drephius
|
Posted - 2009.08.10 10:29:00 -
[5]
Edited by: Arous Drephius on 10/08/2009 10:29:34 You want mapsolarsystems and mapsolarsystemjumps.
There's no need for Pythagoras for this if all you want is the list of systems n jumps from x.
|
Tonto Auri
Vhero' Multipurpose Corp
|
Posted - 2009.08.14 14:48:00 -
[6]
Hehe... as always, someone else did all the work for you, you just have to look in the right place, to grab it... -- Thanks CCP for cu |
SK Rooster
No Trademark
|
Posted - 2009.08.16 08:21:00 -
[7]
http://www.evealliance.com/index.php?ind=jumpmap
|
Splinter McIron
|
Posted - 2009.08.17 05:37:00 -
[8]
Edited by: Splinter McIron on 17/08/2009 05:38:14 I wrote a program to do something similar to this...I probably still have the source code, if not, it's not very difficult to do. Just pick a starting point, and, with a list of all From, To gate pairs, do a BFS (breadth first search) out to level X (where X is the number of jumps from where you are starting). I might have a list of To,From gate pairs...*looks* ah, there it is, and the source code :)
It would be a very minor tweak to the program to make it do what you want it to. Just let me know via either in-game or a reply to this topic...I'll keep an eye out if you are interested.
-Nam Noissim (grr...I changed forum settings and it didn't take, anyway, Nam is my main char)
|
|
|
|
Pages: [1] :: one page |
First page | Previous page | Next page | Last page |