title: Dijkstra's shortest path algorithm modification
body: <p>I am working on images for a personal project and I stuck at a step (moreover it is a relatively easier step) My question is not related to the images by the way.</p>
  
  <p>I am calculating int values for each pixel on the image. And I want to find the path with the minimum cost between to pixels (nodes). Actually I have a working implementation of A* algorithm. But I don't want to use that because I don't want to limit the "map" with nodes that you can pass or cannot pass only. I want that each node can be passed but with a cost. Some nodes will be so costly to pass, some will not. But there will be no nodes that cannot be passed. </p>
  
  <p>I don't think I need to give any code because it is a very isolated part of the project. So I don't want to maniplute anybody. But basically I have a map object that has a list of nodes. And nodes have id, x,y positions. cost, neighbours (top,bottom,left and right pixels) and a node reference to know from where I came here etc.</p>
  
  <p>I hope I could express the difference from Dijkstra's shortest path algorithm. How can I modify it accordingly? Or can anybody reccomend another way to do this?</p>