Following a similar design process, we will design efficient algorithms for a sequence of problems: shortest paths, minimal cycle ratios, maximal network flows, min-cost flows, and convex cost flows.