title: 2D array path finding
body: <p>I want to find the minimum weighted path between two indexes of an 2D array. I have tried to implement Dijkstra's shortest path algorithm and A* but I couldn't. There is an example below. I want to give starting and ending point of path and the path should be returned by the algorithm. </p>
  
  <p><strong>0 2</strong> 5 8 8 9 </p>
  
  <p>5 <strong>1 2</strong> 7 9 8 </p>
  
  <p>9 8 <strong>2</strong> 5 7 8 </p>
  
  <p>8 8 <strong>2 2 2</strong> 9 </p>
  
  <p>9 7 6 3 <strong>2</strong> 7 </p>
  
  <p>8 8 6 5 3 5</p>
  
  <p>Can anybody reccomend other algorithms or guide me about the algorithms?</p>
  
  <p>I am working on this for days and I don't think it is a challenging problem at all. But I lost my temper and cannot think healty. For example, I even could not understand whether a* and dijkstra's shorthest path is directly related to what I want to do. Or they work for 0 and 1 like structures that if there is a wall you cannot pass from there if not you can. In my problem you can pass from anywhere but I want to find the least cost path etc.</p>