Update app.py

app.py

@@ -45,15 +45,18 @@ def held_karp_tsp(dist_matrix):
     tour = [0]
     bits = (2 ** n - 1) - 1
     for _ in range(n - 1):
-        tour.append(last_city)
-        bits &= ~(1 << last_city)
-        if bits == 0:
+        if last_city is not None:
+            tour.append(last_city)
+            bits &= ~(1 << last_city)
+            if bits == 0:
+                break
+            next_city = min(
+                [(memo[(bits, k)] + dist_matrix[k][last_city], k) for k in range(n) if (bits, k) in memo],
+                key=lambda x: x[0],
+            )[1]
+            last_city = next_city
+        else:
             break
-        next_city = min(
-            [(memo[(bits, k)] + dist_matrix[k][last_city], k) for k in range(n) if (bits, k) in memo],
-            key=lambda x: x[0],
-        )[1]
-        last_city = next_city
 
     tour.append(0)
     return min_tour_cost, tour
@@ -97,6 +100,9 @@ def plot_route(map_obj, coordinates, route):
 # Streamlit UI
 st.title("Traveling Salesman Problem Solver")
 
+# Create map
+map_obj = folium.Map(location=[0, 0], zoom_start=2)
+
 # Input kota
 st.subheader("Pilih Kota")
 city_count = st.number_input("Jumlah kota", min_value=2, step=1)
@@ -128,4 +134,5 @@ if st.button("Optimasi Rute"):
         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)
+        st.markdown("### Rute Optimal")
+        st_folium = st.components.v1.html(folium.Map._repr_html_(map_obj), width=800, height=600)