2010-11-25 22:40:29 -0600
I finally got some time today (Thanksgiving, what ELSE would I do…) to update/finish the Navigator. It had some bugs, some unfinished features, and lacked the massive benefit of my recent work (see Open Palm, apply to forehead) as a search type. It should now be operating properly (although I have not confirmed that the filters all work perfectly, they should, but haven’t been 100% tested). So, enjoy: The Updated Navigator with its updated database, fixed bugs, and new features.
2010-05-25 12:49:07 -0500
I’ve learned a great lesson over the last few months in regards to programming complexity. I have been working on a solution to uber-rapid filtration of jump distance within the Navigator. My final goal: to have every shortest path available within a database for rapid joining. Anyone that has researched into this will be familiar with typical path-finding techniques, Dijkstra, A*, or any of a dozen others. However there are fewer techniques for finding all paths simultaneously, as those find the shortest route from A to B. I did tons of research in performance etc… to figure out a good way, and came to the conclusion that a formula called The Floyd-Warshall Algorithm. It is theoretically the fastest All Paths Shortest Route calculator for a ‘Dense graph’….aka a system with many connections, such as Eve Online‘s solar systems.
Read the rest...