Algorithms in C

Algorithms in C, Third Edition, Part 5: Graph Algorithms is the second book in Sedgewick's thoroughly revised and rewritten series. The first book, Parts 1-4, addresses fundamental algorithms, data structures, sorting, and searching. A forthcoming third book will focus on strings, geometry, and a range of advanced algorithms. Each book's expanded coverage features new algorithms and implementations, enhanced descriptions and diagrams, and a wealth of new exercises for polishing skills. A focus on abstract data types makes the programs more broadly useful and relevant for the modern object-oriented programming environment.

Coverage includes:

• A complete overview of graph properties and types
• Diagraphs and DAGs
• Minimum spanning trees
• Shortest paths
• Network flows
• Diagrams, sample C code, and detailed algorithm descriptions

Table des matières

• Preface.
• Notes on Exercises.
• 17. Graph Properties and Types.
• 18. Graph Search.
• 19. Digraphs and DAGs.
• 20. Minimum Spanning Trees.
• 21. Shortest Paths.
• 22. Network Flows.
• References.
• Index