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 ...
Read More
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).
Read Less
Add this copy of Algorithms in C++ Part 5: Graph Algorithms to cart. $26.98, fair condition, Sold by Dream Books Co. rated 5.0 out of 5 stars, ships from Denver, CO, UNITED STATES, published 2001 by Addison-Wesley Professional.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Fair. This copy has clearly been enjoyed-expect noticeable shelf wear and some minor creases to the cover. Binding is strong and all pages are legible. May contain previous library markings or stamps.
Add this copy of Algorithms in C++ Part 5: Graph Algorithms to cart. $27.96, good condition, Sold by Goodwill Books rated 5.0 out of 5 stars, ships from Hillsboro, OR, UNITED STATES, published 2001 by Addison-Wesley Professional.
Add this copy of Algorithms in C, Part 5: Graph Algorithms 3rd Edition to cart. $57.00, good condition, Sold by BookScene rated 5.0 out of 5 stars, ships from Hull, MA, UNITED STATES, published 2001 by Addison-Wesley.
Add this copy of Algorithms in C, Part 5: Graph Algorithms to cart. $47.59, very good condition, Sold by FirstClassBooks rated 4.0 out of 5 stars, ships from Little Rock, AR, UNITED STATES.
Add this copy of Algorithms in C++ Part 5: Graph Algorithms to cart. $66.41, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Newport Coast, CA, UNITED STATES, published 2001 by Addison-Wesley Professional.
Add this copy of Algorithms in C, Part 5: Graph Algorithms to cart. $66.72, good condition, Sold by BooksRun rated 4.0 out of 5 stars, ships from Philadelphia, PA, UNITED STATES, published by Addison-Wesley Professional.
Add this copy of Algorithms in C, Part 5: Graph Algorithms to cart. $109.11, good condition, Sold by Bonita rated 4.0 out of 5 stars, ships from Newport Coast, CA, UNITED STATES, published 2001 by Addison-Wesley Professional.
Add this copy of Algorithms in C++ Part 5: Graph Algorithms to cart. $31.97, good condition, Sold by Fact or Fiction rated 3.0 out of 5 stars, ships from Mount Pleasant, SC, UNITED STATES, published 2002 by Addison-Wesley Professional.
