Algorithm: C Language Implementation (Part 5) Graph Algorithms (English Version. 3rd Edition)

Author: Sedgewick
Publisher:
Publish Date: 2006-09-01
Features: This book is the second volume in Sedgewick's series of thoroughly revised and rewritten works, focusing on graph algorithms. The book consists of 6 chapters (Chapters 17-22). Chapter 17 provides a detailed discussion of graph properties and types, while Chapters 18-22 cover graph search, directed graphs and DAGs, minimum spanning trees, shortest paths, and network flow. The book includes complete algorithm source code written in C, along with numerous illustrations and exercises. The author successfully combines theory and practice through concise implementations, all of which can be tested in real-world applications, making the book a favorite among programmers since its release. This book can serve as a textbook and supplementary reading for algorithm and data structure courses in computer-related disciplines at universities and colleges, as well as for self-study. This book is the second volume in Sedgewick's thoroughly revised and rewritten series on C algorithms, focusing on graph algorithms. The book consists of 6 chapters (Chapters 17-22). Chapter 17 provides a detailed discussion of graph properties and types, while Chapters 18-22 cover graph search, directed graphs and DAGs, minimum spanning trees, shortest paths, and network flow. The book includes complete algorithm source code written in C, along with numerous illustrations and exercises. The author successfully combines theory and practice through concise implementations, all of which can be tested in real-world applications, making the book a favorite among programmers since its release. This book can serve as a textbook and supplementary reading for algorithm and data structure courses in computer-related disciplines at universities and colleges, as well as for self-study use.