Ship-Ship-Hooray! Free Shipping on $25+ Details >
Algorithms in C, Part 5: Graph Algorithms

Algorithms in C, Part 5: Graph Algorithms - 3rd edition

Algorithms in C, Part 5: Graph Algorithms - 3rd edition

ISBN13: 9780201316636

ISBN10: 0201316633

Algorithms in C, Part 5: Graph Algorithms by Robert Sedgewick - ISBN 9780201316636
Cover type: Paperback
Edition: 3RD 02
Copyright: 2002
Publisher: Addison-Wesley Longman, Inc.
International: No
Algorithms in C, Part 5: Graph Algorithms by Robert Sedgewick - ISBN 9780201316636

ISBN13: 9780201316636

ISBN10: 0201316633

Cover type: Paperback
Edition: 3RD 02

List price: $69.99

All of our used books are 100% hand-inspected and guaranteed! Happy you, happy us.

Ships directly from us
You Save $34.99 (50%)

This title is currently not available in digital format.

Well, that's no good. Unfortunately, this edition is currently out of stock. Please check back soon.

shop us with confidence


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, with concise implementations that can be tested on real applications, that has made his work popular with programmers for many years.

Alogrithms 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 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.

The coverage here 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 thia book ( 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.

Author Bio

Sedgewick, Robert : Princeton University

Robert Sedgewick is a Professor of Computer Science at Princeton University. He is a Director of Adobe Systems and has served on the research staffs at Xerox PARC, the Institute for Defense Analyses, and INRIA. He received his Ph.D. from Stanford University (under Donald E. Knuth).

Table of Contents

Table of Contents

Notes on Exercises.

17. Graph Properties and Types.

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.
Topological Sorting.
Reachability in DAGs.
Strong Components in Digraphs.
Transitive Closure Revisited.

20. Minimum Spanning Trees.

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.
Negative Weights.

22. Network Flows.

Flow Networks.
Augmenting-Path Maxflow Algorithms.
Preflow-Push Maxflow Algorithms.
Maxflow Reductions.
Mincost Flows.
Network Simplex Algorithm.
Mincost-Flow Reductions.
References for Part Five.