title: Generating Shortest Paths
body: <p>I'm interested in attempting to (quickly) the shortest paths for a given grid.  The grid is n by m where each node corresponds to a position of x,y. Each node can be traveled to by all adjacent nodes with with either a cost of 1 or infinity from adjacent nodes (meaning that's its an unweighted graph where some nodes are impassible).  I haven't chosen constraints on n or m yet but I'd like to be able to pathfind a 100 by 100 graph. I've already tried a couple of options but none have been fast enough.  However, the constraints on the problem (unweighted, easy heuristic), make me think that someone might have a better solution to the problem. </p>
  
  <p>One option that occurred to me (and I would like to do if possible) was pre-generating all of the paths for all options of n and m between 0 and 100. Obviously, that takes a significant amount of time but I was wondering if maybe there was some sort of online resource where I could find paths. Alternatively, if anyone has a method of computing all of the paths for all of the graphs reasonably quickly that would be great to.</p>