Update app.py

app.py

@@ -4,8 +4,6 @@ from geopy.geocoders import Nominatim
 from geopy.distance import geodesic
 from itertools import combinations
 import numpy as np
-import polyline
-import requests
 
 # Algoritma Held-Karp untuk TSP
 def held_karp_tsp(dist_matrix):
@@ -70,11 +68,12 @@ def get_coordinates(city_name):
 
 # Menghitung jarak antar semua pasangan kota
 def create_distance_matrix(coordinates):
-    n = len(coordinates)
+    valid_coordinates = [c for c in coordinates if c is not None]
+    n = len(valid_coordinates)
     dist_matrix = np.zeros((n, n))
     for i in range(n):
         for j in range(i + 1, n):
-            dist_matrix[i][j] = geodesic(coordinates[i], coordinates[j]).kilometers
+            dist_matrix[i][j] = geodesic(valid_coordinates[i], valid_coordinates[j]).kilometers
             dist_matrix[j][i] = dist_matrix[i][j]
     return dist_matrix
 
@@ -96,27 +95,31 @@ def plot_route(map_obj, coordinates, route):
 st.title("Traveling Salesman Problem Solver")
 
 # Input kota
-city_names = st.text_input("Masukkan nama kota (pisahkan dengan koma)", "Jakarta, Bandung, Surabaya, Yogyakarta")
-city_list = [city.strip() for city in city_names.split(",")]
+st.subheader("Pilih Kota")
+city_count = st.number_input("Jumlah kota", min_value=2, step=1)
+city_names = []
+for i in range(int(city_count)):
+    city_name = st.text_input(f"Kota {i+1}", key=f"city_{i}")
+    city_names.append(city_name)
 
-if len(city_list) < 2:
-    st.warning("Masukkan setidaknya dua kota.")
-else:
-    coordinates = [get_coordinates(city) for city in city_list]
-    if None in coordinates:
+if st.button("Optimasi Rute"):
+    coordinates = [get_coordinates(city) for city in city_names]
+    valid_coordinates = [c for c in coordinates if c is not None]
+
+    if len(valid_coordinates) < 2:
         st.error("Ada kota yang tidak ditemukan. Pastikan nama kota benar.")
     else:
         # Buat distance matrix
-        dist_matrix = create_distance_matrix(coordinates)
+        dist_matrix = create_distance_matrix(valid_coordinates)
         min_cost, optimal_route = held_karp_tsp(dist_matrix)
         
         # Tampilkan hasil
         st.write(f"Biaya total minimum: {min_cost:.2f} km")
-        st.write("Rute optimal:", " -> ".join([city_list[i] for i in optimal_route]))
+        st.write("Rute optimal:", " -> ".join([city_names[i] for i in optimal_route]))
 
         # Buat peta
-        map_obj = folium.Map(location=coordinates[0], zoom_start=5)
-        plot_route(map_obj, coordinates, optimal_route)
+        map_obj = folium.Map(location=valid_coordinates[0], zoom_start=5)
+        plot_route(map_obj, valid_coordinates, optimal_route)
         
         # Render map
         st_folium = st.components.v1.html(folium.Map._repr_html_(map_obj), width=700, height=500)