Researchers have devised an "absurdly fast" algorithm to solve the problem of finding the fastest flow through a network.

This course is part three of a specialization on algorithms and data structures. It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It ...