title: Using Dijkstra's Algorithm for pathfinding on a grid
body: <p>Once again having a problem with path finding this time The Dijkstra's</p>
  
  <p>I have read Dijkstra's and its application on a various number of sites.
  It's mostly explained for a Graph and finding out the shortest path to all nodes from a source node.</p>
  
  <p>What I am unable to figure out is how to use Dijkstra's for path finding on a grid as explained on <a href="http://en.wikipedia.org/wiki/File:Dijkstras_progress_animation.gif" rel="nofollow">Wikipedia picture</a>.</p>
  
  <p>since on a grid we have a single destination and we have to figure out the shortest distance to it from the source. I am unable to relate it to the Dijkstra's on a graph.
  There are no tiles to be marked as INFINITY or to compare the distance with other path's/Nodes.</p>
  
  <p>The question in short is how do we proceed using Dijkstra's to find a path in grid using the actual graph algorithm for which this algorithm is defined.
  Do we proceed like BFS and call it Dijkstra's for a grid or is there a difference? because I am unable to figure out any :/ </p>
  
  <p>Thank you :)</p>