FREE Delivery in the UK.
Only 1 left in stock.
Dispatched from and sold by Amazon. Gift-wrap available.
Algorithms in C: Graph Al... has been added to your Basket
+ £2.80 UK delivery
Used: Good | Details
Sold by Nearfine
Condition: Used: Good
Comment: A good reading copy. May contain markings or be a withdrawn library copy. Expect delivery in 2-3 weeks.
Have one to sell?
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See this image

Algorithms in C: Graph Algorithms Pt.5 Paperback – 16 Aug 2001


See all formats and editions Hide other formats and editions
Amazon Price
New from Used from
Kindle Edition
"Please retry"
Paperback
"Please retry"
£43.99
£37.63 £27.94
Note: This item is eligible for click and collect. Details
Pick up your parcel at a time and place that suits you.
  • Choose from over 13,000 locations across the UK
  • Prime members get unlimited deliveries at no additional cost
How to order to an Amazon Pickup Location?
  1. Find your preferred location and add it to your address book
  2. Dispatch to this address when you check out
Learn more
£43.99 FREE Delivery in the UK. Only 1 left in stock. Dispatched from and sold by Amazon. Gift-wrap available.
click to open popover

Special Offers and Product Promotions

Enter your mobile number 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.
Getting the download link through email is temporarily not available. Please check back later.

  • Apple
  • Android
  • Windows Phone

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




Product details

Product Description

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


Customer Reviews

There are no customer reviews yet on Amazon.co.uk.
5 star
4 star
3 star
2 star
1 star

Most Helpful Customer Reviews on Amazon.com (beta)

Amazon.com: HASH(0x96bc072c) out of 5 stars 7 reviews
21 of 24 people found the following review helpful
HASH(0x96bb7270) out of 5 stars A must-have reference for Graph Algorithms 7 Nov. 2001
By Thomas Ventimiglia - Published on Amazon.com
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.
2 of 2 people found the following review helpful
HASH(0x96bb71b0) out of 5 stars Excellent figures, average analysis 3 Aug. 2006
By Rafael F. Ferreira - Published on Amazon.com
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.
7 of 10 people found the following review helpful
HASH(0x96bb7750) out of 5 stars I'm fed up with these books 22 Mar. 2006
By Anders Grönlund - Published on Amazon.com
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.
HASH(0x96bb7588) out of 5 stars very good 7 Jun. 2013
By Juan Gabriel Gutierrez Alva - Published on Amazon.com
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
HASH(0x96bb7714) out of 5 stars Five Stars 18 Nov. 2014
By Gaoping Huang - Published on Amazon.com
Format: Paperback Verified Purchase
Good quality
Were these reviews helpful? Let us know


Feedback