Algorithms in C, Part 5 : Graph Algorithms, 3/e (Paperback)

Robert Sedgewick

  • 出版商: Addison-Wesley Professional
  • 出版日期: 2001-08-26
  • 定價: $950
  • 售價: $950
  • 貴賓價: 9.5$903
  • 語言: 英文
  • 頁數: 512
  • 裝訂: Paperback
  • ISBN: 0201316633
  • ISBN-13: 9780201316636

無法訂購

買這商品的人也買了...

商品描述

Graph algorithms are increasingly critical for a wide range of applications, such as network connectivity, circuit design, scheduling, transaction processing, and resource allocation. In the third edition, many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. Source code for the implementations is available via the Internet.

Table of Contents

Preface.
Notes on Exercises.
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 Flows.

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