Kobe city in Hyogo, Otsu city in Shiga) • Departure: Sapporo city • Destination: Naha city • He is so strong that he run only straight. • He is so strong that he can run through the mountain. • He is so strong that he can run over the sea. • He is so strong that he can run without a break.
office, and calculate the distance from one to another. ② Define the objective (what we want to minimize) ③ Define the constraints ④ Solve！ ※Useful packages: networkx: to build and draw networks pulp: to optimize and decide the best condition