C Algorithm. Volume 2. Graph Algorithms

Author: (USA) Sedgewick / Wayne
Publisher:
Publish Date: 2004-04-01
Features: The graph algorithms discussed in this book are the most important known methods for solving graph problems in practice. The main purpose of this book is to enable more and more people who need to understand these algorithms to master these methods and their basic principles. The book explains the basic principles from basic information in a step-by-step manner, then introduces some classic methods, and finally presents modern techniques that are still being researched and developed. Carefully selected examples, detailed illustrations, and complete implementation code complement the algorithms and applications described in the text. This series of algorithm books introduces the most important algorithms of today, divided into 3 volumes, and this is the 2nd volume (Part 5), focusing on graph algorithms. The book consists of 6 chapters (Chapters 17–22). Chapter 17 discusses graph properties and types in detail, while Chapters 18–22 cover graph search, directed graphs and DAGs, minimum spanning trees, shortest paths, and network flows. The book provides complete algorithm source code and programs described in C, along with rich illustrations and exercises. It can be used as a textbook and supplementary reading for computer-related courses on algorithms and data structures in universities and colleges, as well as for self-study.