Algorithms in C++ Part 5: Graph Algorithms
Sedgewick, Robert
Sold by Seattle Goodwill, Seattle, WA, U.S.A.
AbeBooks Seller since November 7, 2006
Used - Soft cover
Condition: Used - Fair
Quantity: 1 available
Add to basketSold by Seattle Goodwill, Seattle, WA, U.S.A.
AbeBooks Seller since November 7, 2006
Condition: Used - Fair
Quantity: 1 available
Add to basketGraph 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).
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.
"About this title" may belong to another edition of this title.
Returns are accepted according to the Abebooks Returns Policy. We respond to all inquiries within 2 business days.
We ship everything within 48 hours, and all our orders are shipped via UPS Mail Innovations. Please let us know if you have any questions or concerns. Customer satisfaction is our top priority.
Order quantity | 5 to 14 business days | 3 to 6 business days |
---|---|---|
First item | US$ 3.99 | US$ 6.99 |
Delivery times are set by sellers and vary by carrier and location. Orders passing through Customs may face delays and buyers are responsible for any associated duties or fees. Sellers may contact you regarding additional charges to cover any increased costs to ship your items.