Algorithms in C++ Part 5: Graph Algorithms
Sedgewick, Robert
Sold by Keeps Books, Wilmington, IL, U.S.A.
AbeBooks Seller since January 25, 2006
Used - Soft cover
Condition: Very Good
Quantity: 1 available
Add to basketSold by Keeps Books, Wilmington, IL, U.S.A.
AbeBooks Seller since January 25, 2006
Condition: Very Good
Quantity: 1 available
Add to basketCover has light wear. Pages clean & bright, binding tight. Ships Next Business Day.
Seller Inventory # 250419036
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).
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.
Upon receipt of payment, your order is securely packaged and shipped the next business day. All orders within the United States are shipped via the United States Postal Service (USPS). For international orders, we provide Air Mail, Ground or Surface mail and Global priority shipping. In addition to the payment services offered by ABEBooks we also accept US Postal Money Orders and payments through PayPal, and the fund must be paid before shipping. Our Paypal account payment details will be provid...
More InformationShipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.