United States
1. United States
2. United Kingdom
3. Global
Sign In
Contact Us
Bookbag

Available

Algorithms in C++ Part 5: Graph Algorithms, 3rd Edition

Robert Sedgewick, Princeton University

©2002 |Addison-Wesley Professional | Available

Algorithms in C++ Part 5: Graph Algorithms, 3rd Edition — View larger

If You're an Educator

If You're a Student

Buy this product

K-12 educators: This link is for individuals purchasing with credit cards or PayPal only. Contact your Savvas Learning Company Account General Manager for purchase options.

Table of Contents

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

Order

Digital

book cover — Algorithms in C++ Part 5: Graph Algorithms, 3rd Edition

Sedgewick

©2002 | Addison-Wesley Professional

Format	ePub
ISBN-13:	9780768685046
Online purchase price	$47.99	Students, buy or rent this eText
Availability	Live

Paper

book cover — Algorithms in C++ Part 5: Graph Algorithms, 3rd Edition

Sedgewick

©2002 | Addison-Wesley Professional | 528 pp

Format	Paper
ISBN-13:	9780201361186
Suggested retail price	$59.99
Availability	Available

Packages

Featured Packages

Package ISBN-9780201726848

Availability	Available
Online purchase price	$121.48

This package contains:

book cover — Algorithms in C++ Part 5: Graph Algorithms, 3rd Edition

Sedgewick

©2002

Paper

Pearson book cover — Algorithms in C++ Part 5: Graph Algorithms, 3rd Edition

Sedgewick

©2002

Paper

book cover — Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching, 3rd Edition

Sedgewick

©1999

Paper

Pearson book cover — Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching, 3rd Edition

Sedgewick

©1999

Paper

About the Author(s)

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.

0201361183AB06262002

Relevant Courses