title: Dijkstra on 2D grid?
body: <p>There are N points on a 2D grid (x,y). I need to find the shortest path, from point A to point  B, but I can only travel from one point to another and I can't travel between two points if the distance between them is farther than a distance D. I thought it might be solved by using some kind of modified Dijkstra's algorithm, but I'm not sure how, because I've never implemented it before, just studied it on Wiki. </p>