Algorithm V(C implementation): Graph algorithms (3rd Edition. Photocopy Edition)

Author: Robert Sedgewick (USA)
Publisher:
Publish Date: 2003-12-01
Features: Robert Sedgewick once again provides a comprehensive introduction to important and popular algorithms. This time, the focus is on graph algorithms, which have become increasingly important in many applications, such as network connectivity, circuit design, scheduling, transaction processing, and resource allocation. In this book, Sedgewick successfully combines theory and practice with concise implementations, all of which can be tested in real-world applications—this is precisely why his works have been favored by programmers for years. This book is the second in a series that Sedgewick completely revised and rewrote. This (Parts I-IV) introduces fundamentals, data structures, sorting, and searching. The upcoming third book will focus on strings, geometry, and some advanced algorithms. Each new addition in the series includes new algorithms and implementations, improved descriptions and illustrations, as well as numerous exercises to enhance skills. The emphasis on abstract data types makes the programs more versatile and more relevant to modern object-oriented programming environments. This book includes the following content:
A complete overview of graph properties and types
Directed acyclic graphs (DAGs)
Minimum spanning trees
Shortest paths
Network flows
Graphs, sample C code, and detailed algorithm descriptions