shortestPathLength

fun shortestPathLength(from: Cell, to: Cell, heuristic: (current: Cell, target: Cell) -> Double = GridHeuristics.ZERO): Double(source)

Convenience accessor: total weighted cost from from to to, or Double.POSITIVE_INFINITY if unreachable. Returns 0.0 for the self-path.