Always Learning

Algorithms in C++ Part 5: Graph Algorithms, 3/E
Robert SedgewickPrinceton University

ISBN-10: 0201361183
ISBN-13:  9780201361186

Publisher:  Addison-Wesley Professional
Copyright:  2002
Format:  Paper; 528 pp
Published:  12/27/2001
Status: Instock


Customers outside the U.S., click here.


Print this content

In this section:


Description


Features


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



Back to top

Print this content

In this section:


Author Bios

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


Backcover Copy

Once again, Robert Sedgewick provides a current and comprehensive introduction to important algorithms. The focus this time is on graph algorithms, which are increasingly critical for a wide range of applications, such as network connectivity, circuit design, scheduling, transaction processing, and resource allocation. In this book, Sedgewick offers the same successful blend of theory and practice that has made his work popular with programmers for many years. Christopher van Wyk and Sedgewick have developed concise new C++ implementations that both express the methods in a natural and direct manner and also can be used in real applications.

Algorithms in C++, Third Edition, Part 5: Graph Algorithms is the second book in Sedgewick's thoroughly revised and rewritten series. The first book, Parts 1-4, addresses fundamental algorithms, data structures, sorting, and searching. A forthcoming third book will focus on strings, geometry, and a range of advanced algorithms. Each book's expanded coverage features new algorithms and implementations, enhanced descriptions and diagrams, and a wealth of new exercises for polishing skills. A focus on abstract data types makes the programs more broadly useful and relevant for the modern object-oriented programming environment.

Coverage includes:

  • A complete overview of graph properties and types
  • Diagraphs and DAGs
  • Minimum spanning trees
  • Shortest paths
  • Network flows
  • Diagrams, sample C++ code, and detailed algorithm descriptions

The Web site for this book (http://www.cs.princeton.edu/~rs/) provides additional source code for programmers along with a wide range of academic support materials for educators.

A landmark revision, Algorithms in C++, Third Edition, Part 5 provides a complete tool set for programmers to implement, debug, and use graph algorithms across a wide range of computer applications.



0201361183B11282001

Back to top

Log in to the Instructor Resource Center

Login name: 

  Password: 

Forgot login/password?  |  Need to redeem an access code?

        

Instructor Resource Center File Download

This work is protected by local and international copyright laws and is provided solely for the use of instructors in teaching their courses and assessing student learning. Dissemination or sale of any part of this work (including on the World Wide Web) will destroy the integrity of the work and is not permitted. The work and materials from this site should never be made available to students except by instructors using the accompanying text in their classes. All recipients of this work are expected to abide by these restrictions and to honor the intended pedagogical purposes and the needs of other instructors who rely on these materials.

Cancel     I accept, proceed with download

Print this content

Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students, browse our available packages below, or contact your Pearson Higher Education representative to create your own package.

Package ISBN-10: 020172684X | ISBN-13: 9780201726848
©2002 | Instock
Suggested retail price: $112.50  Buy from myPearsonStore

This package contains:

Sedgewick | ©2002 | Addison-Wesley Professional | Paper; 528 pp
Sedgewick | ©1999 | Addison-Wesley Professional | Paper; 752 pp


Package ISBN-10: 0132849151 | ISBN-13: 9780132849159
©2002 | Instock (Additional assembly time required)
Suggested retail price: $140.85  Buy from myPearsonStore

This package contains:

Sedgewick | ©2002 | Addison-Wesley Professional | Paper; 528 pp
Sedgewick | ©1999 | Addison-Wesley Professional | Paper; 752 pp
Kernighan & Pike | ©1999 | Addison-Wesley Professional | Paper; 288 pp


Package ISBN-10: 0321735374 | ISBN-13: 9780321735379
©2006 | Instock (Additional assembly time required)
Suggested retail price: $115.50  Buy from myPearsonStore

This package contains:

Sedgewick | ©2002 | Addison-Wesley Professional | Paper; 528 pp
DePasquale | ©2006 | Addison-Wesley Professional | Paper; 96 pp
Sedgewick | ©1999 | Addison-Wesley Professional | Paper; 752 pp


Back to top