Open palm, apply to forehead: How to resist programming the easy way
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...