mirrors/riiablo
1
0
Fork 0
mirror of https://github.com/collinsmith/riiablo.git synced 2025-02-11 19:37:47 +07:00
Code Issues Actions Packages Projects Releases Wiki Activity

Fixed variable names

Browse Source
This commit is contained in:
Collin Smith 2019-11-23 02:04:30 -08:00
parent 1d820b8bb2
commit b2d8b7f8b9
1 changed files with 9 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
core/src/com/riiablo/map/pfa/AStarPathFinder.java
View File

@ -107,31 +107,31 @@ public class AStarPathFinder implements PathFinder {
Array<Point2> neighbors = graph.getNeighbors(startNode, flags, this.neighbors);
for (Point2 neighbor : neighbors) {
if (neighbor.clearance < size) continue;
float nodeCost = current.g() + uniformHeuristic.estimate(startNode, neighbor);
float g = startNode.g() + uniformHeuristic.estimate(startNode, neighbor);
float nodeHeuristic;
float h;
reset(neighbor);
switch (neighbor.category) {
case Point2.UNVISITED:
nodeHeuristic = heuristic.estimate(neighbor, endNode);
h = heuristic.estimate(neighbor, endNode);
break;
case Point2.OPEN:
if (neighbor.g() <= nodeCost) continue;
if (neighbor.g() <= g) continue;
openList.remove(neighbor);
nodeHeuristic = neighbor.f() - neighbor.g();
h = neighbor.f() - neighbor.g();
break;
case Point2.CLOSED:
if (neighbor.g() <= nodeCost) continue;
nodeHeuristic = neighbor.f() - neighbor.g();
if (neighbor.g() <= g) continue;
h = neighbor.f() - neighbor.g();
break;
default:
throw new AssertionError("Invalid nodeRecord category: " + neighbor.category);
}
neighbor.g = nodeCost;
neighbor.g = g;
neighbor.parent = startNode;
addToOpenList(neighbor, nodeCost + nodeHeuristic);
addToOpenList(neighbor, g + h);
}
}