Algorithms in C++ Part 5 Pts. 5 : Graph Algorithms by Robert Sedgewick (2001,...

schmittzen1
(44)
Seller's other items
Contact seller
US $20.00
Condition:
Very Good
Shipping:
US $5.97 USPS Media MailTM.
Located in: Lake Forest, California, United States
Delivery:
Estimated between Mon, Jul 28 and Sat, Aug 2 to 94104
Delivery time is estimated using our proprietary method which is based on the buyer's proximity to the item location, the shipping service selected, the seller's shipping history, and other factors. Delivery times may vary, especially during peak periods.
Returns:
Seller does not accept returns.
Payments:
       Diners Club
Earn up to 5x points when you use your eBay Mastercard®. Learn moreabout earning points with eBay Mastercard

Shop with confidence

eBay Money Back Guarantee
Get the item you ordered or your money back. Learn moreeBay Money Back Guarantee - opens new window or tab
Seller assumes all responsibility for this listing.
eBay item number:166792263214
Last updated on May 29, 2024 16:26:07 PDTView all revisionsView all revisions

Item specifics

Condition
Very Good: A book that does not look new and has been read but is in excellent condition. No obvious ...
ISBN
9780201361186
Subject Area
Mathematics, Computers
Publication Name
Algorithms in C++ Part 5 Pts. 5 : Graph Algorithms
Publisher
Addison Wesley Professional
Item Length
9.2 in
Subject
Programming Languages / C++, Programming / Algorithms, Algebra / General, Software Development & Engineering / Systems Analysis & Design
Publication Year
2001
Type
Textbook
Format
Trade Paperback
Language
English
Item Height
1.1 in
Author
Robert Sedgewick
Features
Revised
Item Weight
33.6 Oz
Item Width
7.6 in
Number of Pages
528 Pages
Category

About this product

Product Identifiers

Publisher
Addison Wesley Professional
ISBN-10
0201361183
ISBN-13
9780201361186
eBay Product ID (ePID)
795518

Product Key Features

Number of Pages
528 Pages
Language
English
Publication Name
Algorithms in C++ Part 5 Pts. 5 : Graph Algorithms
Subject
Programming Languages / C++, Programming / Algorithms, Algebra / General, Software Development & Engineering / Systems Analysis & Design
Publication Year
2001
Features
Revised
Type
Textbook
Author
Robert Sedgewick
Subject Area
Mathematics, Computers
Format
Trade Paperback

Dimensions

Item Height
1.1 in
Item Weight
33.6 Oz
Item Length
9.2 in
Item Width
7.6 in

Additional Product Features

Edition Number
3
Intended Audience
Scholarly & Professional
LCCN
2002-276304
Dewey Edition
21
Illustrated
Yes
Dewey Decimal
005.13/3
Edition Description
Revised edition
Table Of Content
17. Graph Properties and Types. Glossary. Graph ADT. Adjacency-Matrix Representation. Adjacency-Lists Representation. Variations, Extensions, and Costs. Graph Generators. Simple, Euler, and Hamilton Paths. Graph-Processing Problems. 18. Graph Search. Exploring a Maze. Depth-First Search. Graph-Search ADT Functions. Properties of DFS Forests. DFS Algorithms. Separability and Biconnectivity. Breadth-First Search. Generalized Graph Search. Analysis of Graph Algorithms. 19. Digraphs and DAGs. Glossary and Rules of the Game. Anatomy of DFS in Digraphs. Reachability and Transitive Closure. Equivalence Relations and Partial Orders. DAGs. Topological Sorting. Reachability in DAGs. Strong Components in Digraphs. Transitive Closure Revisited. Perspective. 20. Minimum Spanning Trees. Representations. Underlying Principles of MST Algorithms. Prim's Algorithm and Priority-First Search. Kruskal's Algorithm. Boruvka's Algorithm. Comparisons and Improvements. Euclidean MST. 21. Shortest Paths. Underlying Principles. Dijkstra's algorithm. All-Pairs Shortest Paths. Shortest Paths in Acyclic Networks. Euclidean Networks. Reduction. Negative Weights. Perspective. 22. Network Flow. Flow Networks. Augmenting-Path Maxflow Algorithms. Preflow-Push Maxflow Algorithms. Maxflow Reductions. Mincost Flows. Network Simplex Algorithm. Mincost-Flow Reductions. Perspective. References for Part Five. Index. 0201361183T12172001
Synopsis
Providing exercises to help students learn the properties of algorithms, this text places a greater emphasis on abstract data types, modular programming, object-oriented programming and C++ classes., 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)., 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).
LC Classification Number
QA76.73.C153S38 2002

Item description from the seller

About this seller

schmittzen1

Joined Nov 2011
Seller's other itemsContact

Seller Feedback

No feedback yet

More to explore :