title: Algorithm to find the shortest path, with obstacles
body: <p>I have a collection of Points which represents a grid, I'm looking for an algorithm that gets me the shortest distance between point A and B. 
  The catch being any point (excluding A and B) can have an obstacle obstructing the path, and thus must be detoured. The path may not move in diagonals.</p>
  
  <p>For anyone else looking to solve this type of problem, I found these references to be very useful:</p>
  
  <p><a href="http://optlab-server.sce.carleton.ca/POAnimations2007/DijkstrasAlgo.html" rel="noreferrer">http://optlab-server.sce.carleton.ca/POAnimations2007/DijkstrasAlgo.html</a></p>
  
  <p><a href="http://en.literateprograms.org/Dijkstra%27s_algorithm_%28Java%29#chunk%20def:visit%20each%20vertex%20u,%20always%20visiting%20vertex%20with%20smallest%20minDistance%20first" rel="noreferrer">http://en.literateprograms.org/Dijkstra%27s_algorithm_%28Java%29#chunk%20def:visit%20each%20vertex%20u,%20always%20visiting%20vertex%20with%20smallest%20minDistance%20first</a></p>