Dijkstra is very similar to the A*, it just uses a different approach (going from start point always processing the connection that leads to the smallest total distance).
But the size of the array for sure is too large. dijkstra will never be able to finish its path calculation on that array if you do not make totally unpassable areas.
If you really have a that large map you should consider using waypoints for general movement and when they reach an acceptable waypoint switch to a "zone" like thing in which dijkstra is going to operate.
As you see, the array has 100 Mio entries ... if you use types the whole thing means 100MB * sizeof(Type) ... It is just to large to fit in regular RAM amounts ...
I have no idea how you come to think that you have a low ram usage ...
But the size of the array for sure is too large. dijkstra will never be able to finish its path calculation on that array if you do not make totally unpassable areas.
If you really have a that large map you should consider using waypoints for general movement and when they reach an acceptable waypoint switch to a "zone" like thing in which dijkstra is going to operate.
As you see, the array has 100 Mio entries ... if you use types the whole thing means 100MB * sizeof(Type) ... It is just to large to fit in regular RAM amounts ...
I have no idea how you come to think that you have a low ram usage ...