Picture 1 of 1

Stock photo

Algorithms in C, Part 5 Pt. 5 : Graph Algorithms by Robert Sedgewick (2001, Trade Paperback)

Great Book Prices Store (336782)

96.6% positive Feedback

Price:

US $91.12

Approximately£67.85

+ $19.99 postage

Estimated delivery Mon, 23 Jun - Mon, 30 Jun

Returns:

14 days return. Buyer pays for return postage. If you use an eBay delivery label, it will be deducted from your refund amount.

Condition:

New

Algorithms in C : Graph Algorithms, Paperback by Sedgewick, Robert, ISBN 0201316633, ISBN-13 9780201316636, Brand New, Free shipping in the US Defines and explores the implementation and figures of the algorithms required for various applications, offering commentary, descriptions, and exercises for developers, researchers, and students.

About this product

Product Identifiers

PublisherAddison Wesley Professional

ISBN-100201316633

ISBN-139780201316636

eBay Product ID (ePID)71172

Product Key Features

Number of Pages512 Pages

Publication NameAlgorithms in C, Part 5 pt. 5 : Graph Algorithms

LanguageEnglish

Publication Year2001

SubjectProgramming / Algorithms, Geometry / General, Algebra / General, Software Development & Engineering / Systems Analysis & Design

FeaturesRevised

TypeTextbook

AuthorRobert Sedgewick

Subject AreaMathematics, Computers

FormatTrade Paperback

Dimensions

Item Height1.1 in

Item Weight33.9 Oz

Item Length9.2 in

Item Width7.7 in

Additional Product Features

Edition Number3

Intended AudienceScholarly & Professional

LCCN97-023418

Dewey Edition21

IllustratedYes

Dewey Decimal005.1/33

Table Of ContentPreface. 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. 0201316633T09172001

Edition DescriptionRevised edition

SynopsisOnce 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., 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., 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.

LC Classification NumberQA76.73.C15S4 2001