private void updateBackwardFrontier(Node node, float nodeScore) { #if DEBUG_PATHFINDING if (showDebug) { DebugDrawer.Draw(new Vector2Int(node.parentB.x, node.parentB.y), new Vector2Int(node.x, node.y), Color.red); DebugDrawer.DrawCube(new Vector2Int(node.x, node.y), Vector2Int.one, Color.red); } #endif if (node.isClosedA()) { var pathLength = node.costA + nodeScore; if (bestPathLength > pathLength) { bestPathLength = pathLength; middleNode = node; } } }