I want to use Dijkstra for my game. I tried BFS but it returned me ugly paths. Yes, I know, I'm very picky
I do have Dijkstra implemented already, but my implementation is way too big for a 4K game, 180 lines...which I could probably optimize down to 140 lines quite easily as I've not done any optimization on it.
The data structures is really what is taking up lots of space. Having to maintain a sorted open list and also a closed list takes up some space. Not to mention performing operations on those! (check if in open/closed, add, remove).
So, what I wanted to discuss here are good ways to implement something like a 4K-pathfinder (Dijkstra preferred) that can be applied on a tile[cols][rows] map.
What have people done here in the past?