Bild 1 von 24
Galerie
Bild 1 von 24
Algorithmen in C, Teil 5: Graph Algorithmen von Robert Sedgewick-
US $39,50
Ca.EUR 34,01
Artikelzustand:
“Very Good, clean and tight softcover.”
Sehr gut
Buch, das nicht neu aussieht und gelesen wurde, sich aber in einem hervorragenden Zustand befindet. Der Einband weist keine offensichtlichen Beschädigungen auf. Bei gebundenen Büchern ist der Schutzumschlag vorhanden (sofern zutreffend). Alle Seiten sind vollständig vorhanden, es gibt keine zerknitterten oder eingerissenen Seiten und im Text oder im Randbereich wurden keine Unterstreichungen, Markierungen oder Notizen vorgenommen. Der Inneneinband kann minimale Gebrauchsspuren aufweisen. Minimale Gebrauchsspuren. Genauere Einzelheiten sowie eine Beschreibung eventueller Mängel entnehmen Sie bitte dem Angebot des Verkäufers.
- Sofort-KaufenAlgorithmen in C, Teil 5: Graph Algorithmen von Robert Sedgewick
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Versand:
US $5,22 (ca. EUR 4,49) USPS Media MailTM.
Standort: Boston, Massachusetts, USA
Lieferung:
Lieferung zwischen Fr, 15. Aug und Mi, 20. Aug nach 94104 bei heutigem Zahlungseingang
Rücknahme:
60 Tage Rückgabe. Käufer zahlt Rückversand. Wenn Sie ein eBay-Versandetikett verwenden, werden die Kosten dafür von Ihrer Rückerstattung abgezogen.
Zahlungen:
Sicher einkaufen
- Gratis Rückversand im Inland
- Punkte für jeden Kauf und Verkauf
- Exklusive Plus-Deals
Der Verkäufer ist für dieses Angebot verantwortlich.
eBay-Artikelnr.:157128391390
Artikelmerkmale
- Artikelzustand
- Sehr gut
- Hinweise des Verkäufers
- “Very Good, clean and tight softcover.”
- Educational Level
- Adult & Further Education
- Personalized
- No
- Level
- Beginner, Intermediate
- Country/Region of Manufacture
- United States
- ISBN
- 9780201316636
Über dieses Produkt
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
Publication Name
Algorithms in C, Part 5 pt. 5 : Graph Algorithms
Language
English
Publication Year
2001
Subject
Programming / Algorithms, Geometry / General, Algebra / General, Software Development & Engineering / Systems Analysis & Design
Features
Revised
Type
Textbook
Subject Area
Mathematics, Computers
Format
Trade Paperback
Dimensions
Item Height
0.7 in
Item Weight
27.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
Artikelbeschreibung des Verkäufers
Rechtliche Informationen des Verkäufers
Info zu diesem Verkäufer
Larry-BOS
100% positive Bewertungen•1.058 Artikel verkauft
Angemeldet als gewerblicher Verkäufer
Verkäuferbewertungen (378)
- c***c (55)- Bewertung vom Käufer.Letzte 6 MonateBestätigter KaufThe book was shipped very quickly and arrived exceptionally well-packaged. It was essentially as described in the listing--no surprise there. I would highly recommend this seller for a very positive experience. This book (Vol. 4) represents one more in my quest to have a complete set of all 15. Still looking for Vols. 5 and 14 in as good a shape as your Vol 4. If you can help me there, shoot me an e-mail Larry-BOS. ThanksHistory of United States Naval Operations in World War II Vol IVMidway Coral Sea (Nr. 156730085228)
- u***e (4118)- Bewertung vom Käufer.Letzte 6 MonateBestätigter KaufItem was packed well and shipped promptly. Exactly as described in the listing. Great seller!The Vor Game by Lois McMaster Bujold (2010, Hardcover) (Nr. 156663723894)
- g***g (264)- Bewertung vom Käufer.Letzte 6 MonateBestätigter KaufItem was exactly as described in like new condition and shipped fast. Thank you! Great seller!
Noch mehr entdecken:
- Nora Roberts Belletristik-Bücher,
- Hörbücher Nora Roberts,
- Nora Roberts Belletristik Romane,
- Robert Jordan Belletristik-Bücher,
- Nora Roberts Hörbücher auf Deutsch,
- Nora-Roberts-Frauenliteratur-Belletristik - Bücher,
- Robert-A. - Heinlein-Belletristik-Bücher,
- Nora-Roberts-Abenteuer-Belletristik - Bücher auf Deutsch,
- Robert-Jordan-Das-Rad - der-Zeit-Belletristik-Bücher,
- Nora-Roberts-Frauenliteratur-Belletristik - Bücher auf Deutsch