Algorithms in C++ Part 5: Graph Algorithms

Sedgewick, Robert

ISBN 10: 0201361183 / ISBN 13: 9780201361186

Edité par Addison-Wesley Professional, 2001

Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less. N° de réf. du vendeur G0201361183I5N00

Synopsis :

Graph algorithms are critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. The latest in Robert Sedgewick's classic series on algorithms, this is the field's definitive guide to graph algorithms for C++. Far more than a "revision," this is a thorough rewriting, five times as long as the previous edition, with a new text design, innovative new figures, more detailed descriptions, and many new exercises -- all designed to dramatically enhance the book's value to developers, students, and researchers alike. The book contains six chapters covering graph properties and types, graph search, directed graphs, minimal spanning trees, shortest paths, and networks -- each with diagrams, sample code, and detailed descriptions intended to help readers understand the basic properties of as broad a range of fundamental graph algorithms as possible. The basic properties of these algorithms are developed from first principles; discussion of advanced mathematical concepts is brief, general, and descriptive, but proofs are rigorous and many open problems are discussed. Sedgewick focuses on practical applications, giving readers all the information and real (not pseudo-) code they need to confidently implement, debug, and use the algorithms he covers. (Also available: Algorithms in C++: Parts 1-4, Third Edition, ISBN: 0-201-35088-2).

À propos de l'auteur:

Robert Sedgewick is the William O. Baker Professor of Computer Science at Princeton University. He is a Director of Adobe Systems and has served on the research staffs at Xerox PARC, IDA, and INRIA. He earned his Ph.D from Stanford University under Donald E. Knuth.

0201361183AB06262002

Détails bibliographiques

Titre : Algorithms in C++ Part 5: Graph Algorithms
Éditeur : Addison-Wesley Professional
Date d'édition : 2001
Reliure : Paperback
Etat : Fair
Etat de la jaquette : No Jacket
Edition : 3ème Édition