Remove duplicates from the solutions

src/processing.py

@@ -37,11 +37,9 @@ def greedy_algorithm(n, m, data):
     solutions = solutions.append(first_solution, ignore_index=True)
     for _ in range(m):
         last_solution = solutions["point"].tail(n=1)
-        centroid, furthest_index = get_furthest_element(
+        centroid, index = get_furthest_element(element=int(last_solution), data=data)
-            element=int(last_solution), data=data
-        )
         solutions = solutions.append(dict(centroid), ignore_index=True)
-        data = data.drop(furthest_index)
+        data = data.drop(index)
     return solutions