I made a long-distance-route-plotter for #EliteDangerous currently it's using BFS to compute the route, which is quite slow (almost 40 minutes for a route accross the galaxy, checks visits 73% of the 27M systems in EDSM), i tried using a priority queue with the distance to the goal as the priority but that returned a sub-optimal route) and i can't do bi-directional BFS because of how the search is currently implemented (KD-Tree -> get neares neighbors in radius , queue those)
@Earthnuker did you try A*? Djikstra's algorithm?
@Earthnuker oh sorry didn't read the last part
@cosine i did try A* but that gave me a suboptimal path, and Dijkstra on an unweighted graph is just BFS, currently trying out bi-directional BFS but that's a lot slower for some reason
@Earthnuker oh funky
@Earthnuker so it needs to be 100% optimal? that sucs
The social network of the future: No ads, no corporate surveillance, ethical design, and decentralization! Own your data with Mastodon!