Algorithms in C, Part 5

Graph Algorithms

Specificaties
E-book, blz. | Engels
Pearson Education | e druk, 2001
ISBN13: 9780768684759
Rubricering
Juridisch :
Pearson Education e druk, 2001 9780768684759
Verwachte levertijd ongeveer 9 werkdagen

Samenvatting

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, which has made his work popular with programmers for many years.

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

Specificaties

ISBN13:9780768684759
Taal:Engels
Bindwijze:e-book

Inhoudsopgave

<br> <br> Preface. <br> <br> <br> Notes on Exercises. <br> <br> <br> 17. Graph Properties and Types. <br> <p> </p> <div style="margin-left: 0.2in;"> Glossary. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Graph ADT. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Adjacency-Matrix Representation. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Adjacency-Lists Representation. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Variations, Extensions, and Costs. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Graph Generators. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Simple, Euler, and Hamilton Paths. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Graph-Processing Problems. </div> <p></p> <br> <br> 18. Graph Search. <br> <p> </p> <div style="margin-left: 0.2in;"> Exploring a Maze. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Depth-First Search. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Graph-Search ADT Functions. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Properties of DFS Forests. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> DFS Algorithms. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Separability and Biconnectivity. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Breadth-First Search. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Generalized Graph Search. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Analysis of Graph Algorithms. </div> <p></p> <br> <br> 19. Digraphs and DAGs. <br> <p> </p> <div style="margin-left: 0.2in;"> Glossary and Rules of the Game. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Anatomy of DFS in Digraphs. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Reachability and Transitive Closure. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Equivalence Relations and Partial Orders. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> DAGs. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Topological Sorting. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Reachability in DAGs. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Strong Components in Digraphs. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Transitive Closure Revisited. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Perspective. </div> <p></p> <br> <br> 20. Minimum Spanning Trees. <br> <p> </p> <div style="margin-left: 0.2in;"> Representations. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Underlying Principles of MST Algorithms. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Prim's Algorithm and Priority-First Search. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Kruskal's Algorithm. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Boruvka's Algorithm. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Comparisons and Improvements. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Euclidean MST. </div> <p></p> <br> <br> 21. Shortest Paths. <br> <p> </p> <div style="margin-left: 0.2in;"> Underlying Principles. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Dijkstra's algorithm. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> All-Pairs Shortest Paths. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Shortest Paths in Acyclic Networks. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Euclidean Networks. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Reduction. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Negative Weights. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Perspective. </div> <p></p> <br> <br> 22. Network Flows. <br> <p> </p> <div style="margin-left: 0.2in;"> Flow Networks. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Augmenting-Path Maxflow Algorithms. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Preflow-Push Maxflow Algorithms. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Maxflow Reductions. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Mincost Flows. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Network Simplex Algorithm. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Mincost-Flow Reductions. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Perspective. </div> <p></p> <br> <br> References for Part Five. <br> <br> <br> Index. 0201316633T09172001 <br>

Net verschenen

Rubrieken

Populaire producten

    Personen

      Trefwoorden

        Algorithms in C, Part 5