Best in textbook rentals since 2012!
ISBN-10: 0201316633
ISBN-13: 9780201316636
Edition: 3rd 2002 (Revised)
List price: $69.99
Mkt
This item qualifies for FREE shipping.
30 day, 100% satisfaction guarantee!
This item will ship on
Wednesday, April 24.
what's this?
Rush Rewards U
Members Receive:
You have reached 400 XP and carrot coins. That is the daily max!
Graph algorithms are increasingly critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. The latest book in Robert Sedgewick's classic series on algorithms focuses entirely on graph algorithms, introducing many new implementations and figures, extensive new commentary, more detailed descriptions, and hundreds of new exercises. For developers, researchers and students alike, this is the definitive guide to graph algorithms. 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. For all developers, computer science researchers, engineers, and students of algorithms. (Also available: the companion book Algorithms in C: Parts 1-4, Third Edition, ISBN: 0-201-314525).