makhidkarun / traveller_pyroute

Traveller trade route generator
MIT License
14 stars 5 forks source link

Hook up approximate shortest-path forests for heuristics #96

Closed CyberiaResurrection closed 9 months ago

CyberiaResurrection commented 9 months ago

Instead of tracking the largest-WTN system in each connected component, this PR changes tack:

As there's now three landmarks per component, the approx-SP lower bound is now the maximum of those bounds, which most of the time (90-odd %) works out tigether than the static bounds.

I also re-arranged the main processing loop of astar_path_indexes, special-cased neighbours that are the pathfinding target, and ripped out the bits that had become vestigial.