Summary
In this chapter, we explored transportation problems and routing problems, which come up often in real-world industries. We found the shortest paths between stores with the Dijkstra and A* algorithms on two example store networks. We then considered the traveling salesman problem for optimal route planning on our two store networks to see how connectivity impacts route length. Finally, we considered optimal cuts to maximize flow on a small city network. In the next chapter, we’ll tackle clustering on networks by examining ecological data.
