def heuristic_estimate_of_distance(start, goal):
    """
    This should be >= 0
    If you want to be sure, that the found path is the sortest one,
    let this return a constant 0.
    """
    l = len(goal)
    return (sum([(start[i] + goal[i]) ** 2 for i in range(l)])) ** 0.5
dataset/ETHPy150Open tuturto/pyherc/src/pyherc/data/geometry.py/heuristic_estimate_of_distance/operator `-` -> `+`