如何在{0,1,2} ^ 12中一遍又一遍地找到最近的向量

import numpy as np

def euclidean_distance(v1, v2):
    return np.linalg.norm(v1 - v2)

def find_closest_vectors(vectors):
    closest_vectors = (None, None)
    closest_distance = float('inf')
    for i in range(len(vectors)):
        for j in range(i + 1, len(vectors)):
            distance = euclidean_distance(vectors[i], vectors[j])
            if distance< closest_distance:
                closest_distance = distance
                closest_vectors = (vectors[i], vectors[j])
    return closest_vectors

vectors = np.array([[0, 1, 2], [3, 4, 5], [6, 7, 8]])
closest_vectors = find_closest_vectors(vectors)
print(closest_vectors)