In the k$-$nearest$-$neighbors algorithm, distance is usually measured as the Euclidean $($straight$-$line$)$ distance between points.