I’ve done a fair bit of reading around this, and know that discussions regarding this algorithm in Java have been semi-frequent. My issue with implementing Dijkstra’s algorithm in Java is simply that I’m not sure how to prepare my data. I have a set of coordinates within an array, and a set of 1s and 0s in a matrix that
Tag: dijkstra
Java Maze shortest path 2d int array
I am currently stuck on a project. My aim is to use Dijkstra’s algorithm. I understand that I start at point (0,0) I look at the two nodes next to the start point and then I move to the smallest first and look at the surrounding nodes. My maze is random but to make it easy to start lets say