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. Algorithms in C. Robert Sedgewick.
Book Description
This is the latest version of Sedgewick's best-selling series, reflecting an indispensable body of knowledge developed over the past several decades.
This textbook surveys the most important algorithms and data structures in use today. Applications to science, engineering, and industry are a key feature of the text. We motivate each algorithm that we address by examining its impact on specific applications.
About the Authors
Robert Sedgewick is William O. Baker Professor of Computer Science at Princeton University and a member of the board of directors of Adobe Systems. In addition, he is the coauthor of the highly acclaimed textbook, Algorithms, 4th Edition and Introduction to Programming in Java: An Interdisciplinary Approach.
Kevin Wayne is the Phillip Y. Goldman Senior Lecturer in Computer Science at Princeton University, where he has been teaching since 1998. He received a Ph.D. in operations research and industrial engineering from Cornell University. His research interests include the design, analysis, and implementation of algorithms, especially for graphs and discrete optimization.
Reviews, Ratings, and Recommendations:Related Book Categories:Read and Download Links:Similar Books:
Once again, Robert Sedgewick provides a current andcomprehensive introduction to important algorithms. The focus thistime is on graph algorithms, which are increasingly critical for awide range of applications, such as network connectivity, circuitdesign, scheduling, transaction processing, and resourceallocation. In this book, Sedgewick offers the same successfulblend of theory and practice that has made his work popular withprogrammers for many years. Christopher van Wyk and Sedgewick havedeveloped concise new C++ implementations that both express themethods in a natural and direct manner and also can be used in realapplications.
Algorithms in C++, Third Edition, Part 5: GraphAlgorithms is the second book in Sedgewick's thoroughlyrevised and rewritten series. The first book, Parts 1-4, addressesfundamental algorithms, data structures, sorting, and searching. Aforthcoming third book will focus on strings, geometry, and a rangeof advanced algorithms. Each book's expanded coverage features newalgorithms and implementations, enhanced descriptions and diagrams,and a wealth of new exercises for polishing skills. A focus onabstract data types makes the programs more broadly useful andrelevant for the modern object-oriented programmingenvironment.
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 algorithmdescriptions
The Web site for this book (http://www.cs.princeton.edu/~rs/)provides additional source code for programmers along with a widerange of academic support materials for educators.
A landmark revision, Algorithms in C++, Third Edition,Part 5 provides a complete tool set for programmers toimplement, debug, and use graph algorithms across a wide range ofcomputer applications.