added neighbor.cost to next g score calculation

Author: paulrobello

src/finders/AStarFinder.js

@@ -95,7 +95,7 @@ AStarFinder.prototype.findPath = function(startX, startY, endX, endY, grid) {
 
             // get the distance between current node and the neighbor
             // and calculate the next g score
-            ng = node.g + ((x - node.x === 0 || y - node.y === 0) ? 1 : SQRT2);
+            ng = node.g + neighbor.cost + ((x - node.x === 0 || y - node.y === 0) ? 1 : SQRT2);
 
             // check if the neighbor has not been inspected yet, or
             // can be reached with smaller cost from the current node

src/finders/BiAStarFinder.js

@@ -103,7 +103,7 @@ BiAStarFinder.prototype.findPath = function(startX, startY, endX, endY, grid) {
 
             // get the distance between current node and the neighbor
             // and calculate the next g score
-            ng = node.g + ((x - node.x === 0 || y - node.y === 0) ? 1 : SQRT2);
+            ng = node.g + neighbor.cost + ((x - node.x === 0 || y - node.y === 0) ? 1 : SQRT2);
 
             // check if the neighbor has not been inspected yet, or
             // can be reached with smaller cost from the current node
@@ -147,7 +147,7 @@ BiAStarFinder.prototype.findPath = function(startX, startY, endX, endY, grid) {
 
             // get the distance between current node and the neighbor
             // and calculate the next g score
-            ng = node.g + ((x - node.x === 0 || y - node.y === 0) ? 1 : SQRT2);
+            ng = node.g + neighbor.cost + ((x - node.x === 0 || y - node.y === 0) ? 1 : SQRT2);
 
             // check if the neighbor has not been inspected yet, or
             // can be reached with smaller cost from the current node