Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.

  • Apple
  • Android
  • Windows Phone
  • Android

To get the free app, enter your mobile phone number.

Algorithms in C, Part 5: Graph Algorithms (3rd Edition) (Pt.5) 3rd Edition

3.9 out of 5 stars 7 customer reviews
ISBN-13: 978-0201316636
ISBN-10: 0201316633
Why is ISBN important?
ISBN
This bar-code number lets you verify that you're getting exactly the right version or edition of a book. The 13-digit and 10-digit formats both work.
Scan an ISBN with your phone
Use the Amazon App to scan ISBNs and compare prices.
Trade in your item
Get a $5.58
Gift Card.
Have one to sell? Sell on Amazon
Rent On clicking this link, a new layer will be open
$17.77 On clicking this link, a new layer will be open
Buy used On clicking this link, a new layer will be open
$53.79 On clicking this link, a new layer will be open
Buy new On clicking this link, a new layer will be open
$58.79 On clicking this link, a new layer will be open
More Buying Choices
25 New from $44.00 29 Used from $17.69
Free Two-Day Shipping for College Students with Prime Student Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


Windows10ForDummiesVideo
Windows 10 For Dummies Video Training
Get up to speed with Windows 10 with this video training course from For Dummies. Learn more.
$58.79 FREE Shipping. In Stock. Ships from and sold by Amazon.com. Gift-wrap available.
click to open popover

Frequently Bought Together

  • Algorithms in C, Part 5: Graph Algorithms (3rd Edition) (Pt.5)
  • +
  • Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching (3rd Edition) (Pts. 1-4)
  • +
  • Digital Design: Principles and Practices (4th Edition, Book only)
Total price: $348.95
Buy the selected items together

Editorial Reviews

From the Back Cover

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.

About the Author

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.



0201316633AB06262002

NO_CONTENT_IN_FEATURE

The latest book club pick from Oprah
"The Underground Railroad" by Colson Whitehead is a magnificent novel chronicling a young slave's adventures as she makes a desperate bid for freedom in the antebellum South. See more

Product Details

  • Paperback: 512 pages
  • Publisher: Addison-Wesley Professional; 3 edition (August 26, 2001)
  • Language: English
  • ISBN-10: 0201316633
  • ISBN-13: 978-0201316636
  • Product Dimensions: 7.7 x 1.1 x 9.2 inches
  • Shipping Weight: 1.6 pounds (View shipping rates and policies)
  • Average Customer Review: 3.9 out of 5 stars  See all reviews (7 customer reviews)
  • Amazon Best Sellers Rank: #138,864 in Books (See Top 100 in Books)

Customer Reviews

Top Customer Reviews

Format: Paperback
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.
Comment 21 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Paperback
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.
Comment 2 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Paperback
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.
Comment 7 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Paperback Verified Purchase
Very good, good examples and very clarified explanations, i will recommend it to everyone on the area of graph theory and computer science
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse

Set up an Amazon Giveaway

Algorithms in C, Part 5: Graph Algorithms (3rd Edition) (Pt.5)
Amazon Giveaway allows you to run promotional giveaways in order to create buzz, reward your audience, and attract new followers and customers. Learn more about Amazon Giveaway
This item: Algorithms in C, Part 5: Graph Algorithms (3rd Edition) (Pt.5)