Algorithms in C++ Graph Algorithms

ISBN-10: 0201361183
ISBN-13: 9780201361186
Edition: 3rd 2002 (Revised)
Authors: Robert Sedgewick
List price: $59.99 Buy it from $24.26
eBook available
This item qualifies for FREE shipping

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

30 day, 100% satisfaction guarantee

If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.

Learn more about our returns policy

Description: 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  More...

Used Starting from $38.49
eBooks Starting from $47.99
Buy
what's this?
Rush Rewards U
Members Receive:
coins
coins
You have reached 400 XP and carrot coins. That is the daily max!
You could win $10,000

Get an entry for every item you buy, rent, or sell.

Study Briefs

Limited time offer: Get the first one free! (?)

All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.

Add to cart
Study Briefs
History of Western Art Online content $4.95 $1.99
Add to cart
Study Briefs
History of World Philosophies Online content $4.95 $1.99
Add to cart
Study Briefs
American History Volume 1 Online content $4.95 $1.99
Add to cart
Study Briefs
History of Western Music Online content $4.95 $1.99

Customers also bought

Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading
Loading

Book details

List price: $59.99
Edition: 3rd
Copyright year: 2002
Publisher: Addison Wesley Professional
Publication date: 12/27/2001
Binding: Paperback
Pages: 528
Size: 7.50" wide x 9.00" long x 0.75" tall
Weight: 1.782
Language: English

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 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
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
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
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
Shortest Paths
Underlying Principles
Dijkstra's algorithm
All-Pairs Shortest Paths
Shortest Paths in Acyclic Networks
Euclidean Networks
Reduction
Negative Weights
Perspective
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

×
Free shipping on orders over $35*

*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.

Learn more about the TextbookRush Marketplace.

×