Robert Sedgewick once again provides an up-to-date and comprehensive introduction to key algorithms. This time the center point is graph algorithms, which are becoming increasingly critical for a wide variety of applications such as network connectivity, circuit design, scheduling, transaction processing, and resource allocation. In this book, Sedgewick offers the same successful mix of theory and practice that has made his work popular with programmers for many years, with concise applications that can be tested in real applications.

Algorithms in C, Third Edition, Part 5: Graph Algorithms is the second book in Sedgewick's completely revised and rewritten series. The first book, Chapters 1-4, covers basic algorithms, data structures, sorting, and searching. An upcoming third book will focus on sequences, geometry, and a range of advanced algorithms. The expanded coverage of each book includes new algorithms and applications, enhanced explanations and diagrams, and numerous new exercises for polishing skills. Focusing on abstract data types makes programs more widely useful and relevant for the modern object-oriented programming environment.