[SOURCE CODE] Paths between maps

[skeith_sk8]

Hi all,
Some time ago i developed this project in order to help some guys with a bot project. The zip attached includes a Java code which uses Floyd algortihm in order to get the best paths between the different DarkOrbit maps.

It calculates the path between all maps and it does not use the shortest path (actually its the shortest but i adjusted the weights), it uses the best path for a bot (at least my best path). It can be easily adjusted with the priority var i put on the Main.
It auto-generates three .txt, one for each company, as the path will also depend on your company.

At the moment the logic is ownCompanyMaps > otherCompanyMaps > PVP > 4-4 > 4-5. Its also adjusted to use x-7 maps instead of x-6 maps due to the difference of activity.

What is the use of this? DarkOrbit bot development only (as this is only for darkorbit thats why i put it on this section).

I hope that some devs find this usefull.



PS: Other good idea is to apply a Dijsktra algorithm for this (to calculate all paths of 1 map with the others)
Regards
skeith

[dere1]

It will be very helpful thanks

[Red_John]

Seems nice especially Floyd–Warshall algorithm

You could use more syntactic sugar^^

[skeith_sk8]

Originally Posted by Red_John

Seems nice especially Floyd–Warshall algorithm

You could use more syntactic sugar^^

Imo my syntax has a lot of sugar (i should have done documentation but i was too lazy) Yep, floyd-Warshall algorithm

[[becky]]

oh wow, thanks! I've just learned of these algorithms in college but never thought I have the opportunity to see them being practically used