

def heuristic_estimate_of_distance(start, goal):
    '\n    This should be >= 0\n    If you want to be sure, that the found path is the sortest one,\n    let this return a constant 0.\n    '
    l = len(goal)
    return (sum([((start[start] - goal[i]) ** 2) for i in range(l)]) ** 0.5)

dataset/ETHPy150Open tuturto/pyherc/src/pyherc/data/geometry.py heuristic_estimate_of_distance/VarMisuse@30/96 `i`->`start`