SonOfTheStars
commented
7 years ago Hey, First off all you had me really suprised there that someone is actually working with my crappy codebase 😛 I very much apprechiate that effort of yours! I'm desperate for help as my time to work on this is very limited.
Id definitly love to test your implementation. Yet that requires 2 Things:
- Particle responses when your Router is selecting/Processing nodes(its much easier to notice issues during runtime that way), take a look at the Original A* Router, especially the spawn Particle lines.
- Returning an actual Route. I would have to debug through that dijekstra to full understand it(Routing is not particularily my Ace in hand). The A* gets its route through backtracing the parents it created in the nodes on its way.
Ill write up some more detail shortly.
First of all was this approach of yours Run as a test yet? Was it able to find the Route?
Borimino
Added a NetworkSimplifier, which simplifies the list of nodes in a network to a list of junctions and destinations in a network. Also added DijkstraRouter, which uses Dijkstras algorithm to search through the simplified network. I am not fully able to get a route out of DijkstraRouter yet though.
Once routing has been completely implemented, I believe that this should make routing faster, at the expense of doing some computing when a new node is added to the network.