Algorithms in C, Part 5: Graph Algorithms

Dekorationsartikel gehören nicht zum Leistungsumfang.

Sprache: Englisch

51,95 €*

inkl. MwSt.

Versandkostenfrei per Post / DHL

Lieferzeit 2-4 Werktage

Kategorien:

Der Artikel ist nicht in deutscher Sprache verfasst.
Die Sprache der Produktbeschreibung und Details kann in Englisch angegeben sein. Sollten Sie Verständnisprobleme haben, wenden Sie sich gerne an uns.

Beschreibung

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.

Über den Autor

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.

Inhaltsverzeichnis

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. [...]T[...]

Details

Erscheinungsjahr:	2001
Fachbereich:	Programmiersprachen
Genre:	Importe , Informatik
Rubrik:	Naturwissenschaften & Technik
Medium:	Taschenbuch
Inhalt:	Kartoniert / Broschiert
ISBN-13:	9780201316636
ISBN-10:	0201316633
UPC:	785342316636
EAN:	0785342316636
Sprache:	Englisch
Einband:	Kartoniert / Broschiert
Autor:	Sedgewick, Robert
Auflage:	3. Auflage
Hersteller:	Pearson International
Verantwortliche Person für die EU:	Financial Times Prent., St.-Martin-Str. 82, D-81541 München, salesde@pearson.com
Maße:	235 x 197 x 28 mm
Von/Mit:	Robert Sedgewick
Erscheinungsdatum:	16.08.2001
Gewicht:	0,975 kg

Artikel-ID: 127249353

Über den Autor

Inhaltsverzeichnis

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. [...]T[...]

Details

Erscheinungsjahr:	2001
Fachbereich:	Programmiersprachen
Genre:	Importe , Informatik
Rubrik:	Naturwissenschaften & Technik
Medium:	Taschenbuch
Inhalt:	Kartoniert / Broschiert
ISBN-13:	9780201316636
ISBN-10:	0201316633
UPC:	785342316636
EAN:	0785342316636
Sprache:	Englisch
Einband:	Kartoniert / Broschiert
Autor:	Sedgewick, Robert
Auflage:	3. Auflage
Hersteller:	Pearson International
Verantwortliche Person für die EU:	Financial Times Prent., St.-Martin-Str. 82, D-81541 München, salesde@pearson.com
Maße:	235 x 197 x 28 mm
Von/Mit:	Robert Sedgewick
Erscheinungsdatum:	16.08.2001
Gewicht:	0,975 kg