Algorithms in C, Part 5: Graph Algorithms (3rd Edition) und über 1,5 Millionen weitere Bücher verfügbar für Amazon Kindle. Erfahren Sie mehr

Loggen Sie sich ein, um 1-Click® einzuschalten.
Jetzt eintauschen
und EUR 0,10 Gutschein erhalten
Alle Angebote
Möchten Sie verkaufen? Hier verkaufen
Der Artikel ist in folgender Variante leider nicht verfügbar
Keine Abbildung vorhanden für
Keine Abbildung vorhanden

Beginnen Sie mit dem Lesen von Algorithms in C, Part 5 auf Ihrem Kindle in weniger als einer Minute.

Sie haben keinen Kindle? Hier kaufen oder eine gratis Kindle Lese-App herunterladen.

Algorithms in C, Part 5: Graph Algorithms [Englisch] [Taschenbuch]

Robert Sedgewick
5.0 von 5 Sternen  Alle Rezensionen anzeigen (2 Kundenrezensionen)
Statt: EUR 47,10
Jetzt: EUR 44,70 kostenlose Lieferung. Siehe Details.
Sie sparen: EUR 2,40 (5%)
  Alle Preisangaben inkl. MwSt.
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
Gewöhnlich versandfertig in 2 bis 3 Wochen.
Verkauf und Versand durch Amazon. Geschenkverpackung verfügbar.

Weitere Ausgaben

Amazon-Preis Neu ab Gebraucht ab
Kindle Edition EUR 24,71  
Taschenbuch EUR 44,70  


Oktober 2001 Graph Algorithms

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

Wird oft zusammen gekauft

Algorithms in C, Part 5: Graph Algorithms + Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching
Preis für beide: EUR 104,30

Einer der beiden Artikel ist schneller versandfertig.

Die ausgewählten Artikel zusammen kaufen

Kunden, die diesen Artikel gekauft haben, kauften auch


  • Taschenbuch: 512 Seiten
  • Verlag: Addison Wesley Pub Co Inc; Auflage: Revised. (Oktober 2001)
  • Sprache: Englisch
  • ISBN-10: 0201316633
  • ISBN-13: 978-0201316636
  • Größe und/oder Gewicht: 23,3 x 19,6 x 2 cm
  • Durchschnittliche Kundenbewertung: 5.0 von 5 Sternen  Alle Rezensionen anzeigen (2 Kundenrezensionen)
  • Amazon Bestseller-Rang: Nr. 464.457 in Fremdsprachige Bücher (Siehe Top 100 in Fremdsprachige Bücher)
  • Komplettes Inhaltsverzeichnis ansehen

Mehr über den Autor

Entdecken Sie Bücher, lesen Sie über Autoren und mehr



Graph algorithms are increasingly critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. The latest book in Robert Sedgewick's classic series on algorithms focuses entirely on graph algorithms, introducing many new implementations and figures, extensive new commentary, more detailed descriptions, and hundreds of new exercises. For developers, researchers and students alike, this is the definitive guide to graph algorithms. The book contains six chapters covering graph properties and types, graph search, directed graphs, minimal spanning trees, shortest paths, and networks -- each with diagrams, sample code, and detailed descriptions intended to help readers understand the basic properties of as broad a range of fundamental graph algorithms as possible. The basic properties of these algorithms are developed from first principles; discussion of advanced mathematical concepts is brief, general, and descriptive, but proofs are rigorous and many open problems are discussed.

Sedgewick focuses on practical applications, giving readers all the information and real (not pseudo-) code they need to confidently implement, debug, and use the algorithms he covers. For all developers, computer science researchers, engineers, and students of algorithms. (Also available: the companion book Algorithms in C: Parts 1-4, Third Edition, ISBN: 0-201-314525).

Über den Autor und weitere Mitwirkende

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.



4 Sterne
3 Sterne
2 Sterne
1 Sterne
5.0 von 5 Sternen
5.0 von 5 Sternen
Die hilfreichsten Kundenrezensionen
5.0 von 5 Sternen Qualität gehalten 14. Januar 2002
Von "ulf229"
Als Quereinsteiger brauche ich gelegentlich als Lehrbuch aufbereitetes Hintergrundwissen, wie Sedgewick es einmal mehr präsentiert. Teil 5 - Graphen - bewegt sich sprachlich wie inhaltlich auf dem gleichen Niveau von Teil 1-4. Wohl strukturiert werden klassische Probleme diskutiert und Lösungsansätze vorgestellt. Wer Teil 1-4 nicht gelesen hat und auch sonst über wenig theoretische Grundlagen zu Abstrakten Datentypen wie Listen (einfach/doppelt verlinkt, LIFO/FIFO-Zugriffe) hat und auch nicht weiß, wo er Begriffe wie Pre-/Post-/Inorder-Walk nachschlagen soll, der sollte vom Buch absehen. Alle anderen werden eine logische Fortsetzung von Teil 1-4 vorfinden, die eine breit gestreute, praktische Einführung in die Anwendung von Graphen bietet.
War diese Rezension für Sie hilfreich?
0 von 2 Kunden fanden die folgende Rezension hilfreich
5.0 von 5 Sternen Ottimo libro 14. Dezember 2001
Von A.B.
Robert Sedgewick ha completamente riscritto e ampliato il libro 'Algorithms in C'. Questa nuova edizione, divisa in tre volumi (la terza parte non è ancora stata pubblicata) è veramente interessante. Rispetto all'edizione precedente il codice presentato è corretto e meno criptico, inoltre le spiegazioni sono più chiare e complete.
Consiglio vivamente l'acquisto di tutti i volumi (Parti 1-4, Parte 5, e, quando verrà pubblicata, anche la successiva). Il volume in questione tratta diversi algoritmi, dai più comuni fino a quelli più complicati (Dijkstra,...), presenta numerosi esempi pratici e grafici che illustrano quello che viene fatto dall'algoritmo. Aspettando il terzo volume non posso che assegnare 5 stelle a 'Algorithms in C: Part 5' !
War diese Rezension für Sie hilfreich?
Die hilfreichsten Kundenrezensionen auf (beta) 3.4 von 5 Sternen  5 Rezensionen
20 von 23 Kunden fanden die folgende Rezension hilfreich
5.0 von 5 Sternen A must-have reference for Graph Algorithms 7. November 2001
Von Thomas Ventimiglia - Veröffentlicht auf
As students in Robert Sedgewick's Algorithms and Data Structures Course at Princeton, we had the privilege of reading Part 5 of Algorithms in C in a preprint edition this spring. Its treatment of Graph Algorithms is as thorough and comprehensive as the treatment of sorting and searching in parts 1-4. The algorithms discussed range from the fundamental (Depth-first search, Dijkstra's algorithm), to the relatively obscure (Gabow's strong component algorithm), to the impossibly difficult (Network Simplex), all in great detail. The book also discusses real-world applications of these algorithms, such as arbitrage. It contains a good number of useful diagrams allowing step-by-step traces of the algorithms, which helps decipher the sometimes cryptic code.
A warning: the book is DENSE. It is packed with detailed information and can be a difficult read, especially the mathematical analysis of the algorithms.
All in all, a great book, though.
6 von 8 Kunden fanden die folgende Rezension hilfreich
2.0 von 5 Sternen I'm fed up with these books 22. März 2006
Von Anders Grönlund - Veröffentlicht auf
I bought these two book for one reason: to get help implementing algorithms. Since there is lot of code in these books, I thought this would be a good pick. I was wrong. The author is consistently leaving out details vital to understanding the code. He also makes a big deal about abstract data types. This is gloriously of the case. If the readers are supposed to understand the code, transperency would be a more intelligent goal for the author. There are no comments in the code what so ever (yes, this is actually true, not even in the on-line code). The on-line code to this book is a total mess. You would be able to implement all the algorithms from scratch in less time than it would take you to try and piece together the code the author has left for you.

The pity is that there are very few other algorithm books that have real code. Demand a new edition from the author and don't by this one unless you can avoid it.
1 von 1 Kunden fanden die folgende Rezension hilfreich
3.0 von 5 Sternen Excellent figures, average analysis 3. August 2006
Von Rafael F. Ferreira - Veröffentlicht auf
This is a great book for the reader interested in learning a collection of graph algorithms. Though the C code isn't very clear, the text makes up for it with concise well-written explanations. And the figures do an excellent job of illustrating the execution of the algorithms.

But the problem is that it's not so great a book to study the properties of those algorithms. Most theorems are way too dense and the author relies too much on English explanations, when algebraic expressions would be a lot more explanatory. Sometimes the reader gets a sense that the author is hand-waving instead of giving proper proofs.
5.0 von 5 Sternen very good 7. Juni 2013
Von Juan Gabriel Gutierrez Alva - Veröffentlicht auf
Format:Taschenbuch|Verifizierter Kauf
Very good, good examples and very clarified explanations, i will recommend it to everyone on the area of graph theory and computer science
4 von 8 Kunden fanden die folgende Rezension hilfreich
2.0 von 5 Sternen Better then no book about graph algorithms. 12. Dezember 2004
Von Zac - Veröffentlicht auf
Format:Taschenbuch|Verifizierter Kauf
Robert Sedgewick is certainly well known to all people involved in the development of algorithms form different fields as an author of a number of books about algorithmic methods and data structures. And I am sure that we all appreciate this work because one simply needs all the time a reference to look up not only how one can solve a probem algorithmic but also how one can do this in an efficient way.

This book provides a good overview of algorithms dealing with graphs but the problem is that the connection between the given source code in C and its general exlanation failed. It is clear, that a solution to a problem does not depend on the underlying programing language, hence, Sedgewick's book is anyway not intened to do this otherwise it would wear another title. On the other hand, an algorithm without general explanation brings not much.

I think this book has a conceptual problem. None is interested in preimplemented code, because one normaly has a certain problem the algorithm has to be adapted. In general, this book is better then nothing but far from being a complete source of information concerning the functioning of the algorithms.
Waren diese Rezensionen hilfreich?   Wir wollen von Ihnen hören.
Kundenrezensionen suchen
Nur in den Rezensionen zu diesem Produkt suchen

Kunden diskutieren

Das Forum zu diesem Produkt
Diskussion Antworten Jüngster Beitrag
Noch keine Diskussionen

Fragen stellen, Meinungen austauschen, Einblicke gewinnen
Neue Diskussion starten
Erster Beitrag:
Eingabe des Log-ins

Kundendiskussionen durchsuchen
Alle Amazon-Diskussionen durchsuchen

Ähnliche Artikel finden

Ihr Kommentar