Photo 1/24
Galerie
Photo 1/24
Vous en avez un à vendre ?
Algorithmes en do, partie 5 : algorithmes graphiques par Robert Sedgewick
39,50 USD
Environ33,93 EUR
État :
“Very Good, clean and tight softcover.”
Très bon état
Livre qui ne semble pas neuf, ayant déjà été lu, mais qui est toujours en excellent état. La couverture ne présente aucun dommage apparent. Pour les couvertures rigides, la jaquette (si applicable) est incluse. Aucune page n'est manquante, endommagée, pliée ni déchirée. Aucun texte n'est souligné ni surligné. Aucune note ne figure dans les marges. La couverture intérieure peut présenter des marques d'identification mineures. Marques d'usure et déchirures mineures. Consulter l'annonce du vendeur pour avoir plus de détails et voir la description des défauts.
- Achat immédiatAlgorithmes en do, partie 5 : algorithmes graphiques par Robert Sedgewick
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Livraison :
5,22 USD (environ 4,48 EUR) USPS Media MailTM.
Lieu où se trouve l'objet : Boston, Massachusetts, États-Unis
Délai de livraison :
Estimé entre le jeu. 14 août et le lun. 18 août à 94104
Retours :
Retour sous 60 jours. L'acheteur paie les frais de retour. Si vous utilisez un bordereau d'affranchissement eBay, son coût sera déduit du montant de votre remboursement.
Paiements :
Achetez en toute confiance
Le vendeur assume l'entière responsabilité de cette annonce.
Numéro de l'objet eBay :157128391390
Caractéristiques de l'objet
- État
- Très bon état
- Commentaires du vendeur
- “Very Good, clean and tight softcover.”
- Educational Level
- Adult & Further Education
- Personalized
- No
- Level
- Beginner, Intermediate
- Country/Region of Manufacture
- United States
- ISBN
- 9780201316636
À propos de ce produit
Product Identifiers
Publisher
Addison Wesley Professional
ISBN-10
0201316633
ISBN-13
9780201316636
eBay Product ID (ePID)
71172
Product Key Features
Number of Pages
512 Pages
Language
English
Publication Name
Algorithms in C, Part 5 pt. 5 : Graph Algorithms
Subject
Programming / Algorithms, Geometry / General, Algebra / General, Software Development & Engineering / Systems Analysis & Design
Publication Year
2001
Features
Revised
Type
Textbook
Subject Area
Mathematics, Computers
Format
Trade Paperback
Dimensions
Item Height
1.1 in
Item Weight
33.9 Oz
Item Length
9.2 in
Item Width
7.7 in
Additional Product Features
Edition Number
3
Intended Audience
Scholarly & Professional
LCCN
97-023418
Dewey Edition
21
Illustrated
Yes
Dewey Decimal
005.1/33
Table Of Content
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. 0201316633T09172001
Edition Description
Revised edition
Synopsis
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., 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 Number
QA76.73.C15S4 2001
Description de l'objet fournie par le vendeur
Informations sur le vendeur professionnel
À propos de ce vendeur
Larry-BOS
100% d'évaluations positives•1,1 000 objets vendus
Inscrit comme vendeur professionnel
Évaluations du vendeur (377)
- e***g (2)- Évaluations laissées par l'acheteur.Dernier moisAchat vérifiéQuick shipping and as described! Thank you!
- y***g (633)- Évaluations laissées par l'acheteur.6 derniers moisAchat vérifiéA+
- a***l (159)- Évaluations laissées par l'acheteur.6 derniers moisAchat vérifiéBook as described by the seller. Well packaged. Very pleased to have this book.Deadly Aim The Civil War Story of Michigan's Anishinaabe Sharpshooters -S Walker (n°156841232127)