euclidean distance python
# I hope to be of help and to have understood the request
from math import sqrt # import square root from the math module
# the x and y coordinates are the points on the Cartesian plane
pointA = (x, y) # first point
pointB = (x, y) # second point
distance = calc_distance(pointA, pointB) # here your beautiful result
def calc_distance(p1, p2): # simple function, I hope you are more comfortable
return sqrt((p1[0]-p2[0])**2+(p1[1]-p2[1])**2) # Pythagorean theorempython shortest distance between two points
points = [(1,5), (5,8), (8,1), (9,5)]
def euclideanDistance(coordinate1, coordinate2):
return pow(pow(coordinate1[0] - coordinate2[0], 2) + pow(coordinate1[1] - coordinate2[1], 2), .5)
distances = []
for i in range(len(points)-1):
for j in range(i+1, len(points)):
distances += [euclideanDistance(points[i],points[j])]
print min(distances)Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
