Well, this is a java-like implementation.
[][] is a two dimensional array. You can replace with ds_grid or something in GM
Insert needed behavior to all-caps spots
public int[][] djikstra(Boolean[][] map, List<Point> goals){
int[][] dmap; //INITIALIZE ARRAY HERE IF NEEDED
Queue<Point> q;
Point c;
List<Point> dirs = {new Point(0,1)...}//All possible directions here (cardinal & diagonal) This is my habit. Always over-OOP etc. to avoid if-clusters
for (Point p : goals){ //Iterates through list of goalpoints
if(map[p.x][p.y] == false){
q.add(p);
dmap[p.x][p.y] = INT_MAX;//This marks solid places
}
}
while(q.length() > 0){
c = q.front();
for(Point p : dirs){
if(map[p.x][p.y] == false && dmap[c.x][c.y]>= dmap[p.x][p.y]){
dmap[p.x][p.y] = dmap[c.x][c.y] + 1;
q.add(p);
}
if(map[p.x][p.y] == true{
dmap[p.x][p.y] = INT_MAX;
}
}
}
return dmap;
}
I cannot quarantee this will work but I could think it should work. Yeah initializing and stuff is missing there, but it really doesn't matter if you're going to translate it to GML.
Show Posts
