The second book focuses entirely on graphing algorithms, which are critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation.
These books present nearly 2,000 new exercises, hundreds of new figures, and dozens of new programs.