FREE Delivery in the UK.
Only 2 left in stock.
Dispatched from and sold by Amazon. Gift-wrap available.
Algorithms+in+C++%3A+Graph+... has been added to your Basket
+ £2.80 UK delivery
Used: Good | Details
Sold by rbmbooks
Condition: Used: Good
Comment: Used, good: average wear, reasonable shape, may have limited notes and/or highlighting. Delivered in 10-12 business days from the USA. Money-back guarantee.
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 – 27 Dec 2001

3.6 out of 5 stars 15 customer reviews

See all formats and editions Hide other formats and editions
Amazon Price
New from Used from
Kindle Edition
"Please retry"
Paperback
"Please retry"
£36.99
£34.18 £25.17
Promotion Message 10% Bulk Discount 1 Promotion(s)

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
£36.99 FREE Delivery in the UK. Only 2 left in stock. Dispatched from and sold by Amazon. Gift-wrap available.
click to open popover

Special Offers and Product Promotions

  • Save 10% on Books for Schools offered by Amazon.co.uk when you purchase 10 or more of the same book. Here's how (terms and conditions apply) Enter code SCHOOLS2016 at checkout. Here's how (terms and conditions apply)

Frequently Bought Together

  • Algorithms in C++: Graph Algorithms Pt.5
  • +
  • Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching, Third Edition: Fundamentals, Data Structures, Sorting, Searching Pts. 1-4
Total price: £95.67
Buy the selected items together

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

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




Product details

  • Paperback: 528 pages
  • Publisher: Addison Wesley; 3 edition (27 Dec. 2001)
  • Language: English
  • ISBN-10: 0201361183
  • ISBN-13: 978-0201361186
  • Product Dimensions: 19.3 x 3.3 x 22.9 cm
  • Average Customer Review: 3.6 out of 5 stars  See all reviews (15 customer reviews)
  • Amazon Bestsellers Rank: 458,062 in Books (See Top 100 in Books)
  • See Complete Table of Contents

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 that has made his work popular with programmers for many years. Christopher van Wyk and Sedgewick have developed concise new C++ implementations that both express the methods in a natural and direct manner and also can be used in real applications.

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 a wide range of academic 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.



0201361183B11282001

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.



0201361183AB06262002


Customer Reviews

Top Customer Reviews

Format: Hardcover
This book covers the standard algorithms for searching, sorting, and some math, geometry, and graphing in a readable format. There is also some fun stuff including a brief section on the RSA cryptosystem. The code examples are very skimpy, leaving implementation to the reader, but the concepts are explained very well. Without doubt, a recommendation for intermediate programmers exploring these algorithms for the first or second time and for self-teaching.
Comment 3 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
By A Customer on 9 April 1999
Format: Hardcover
This book is definitely not suitable for a first course in data structures. However, the coverage of algorithms is excellent and the book is suitable for an intermediate level programmer. There is one major problem with the book: no complete source code examples. The better books on programming on the market today include fully worked out source code examples (usually on disk or available through the internet). This book only includes snippets of code, intended to illustrate key aspects of the algorithms. I wanted to work with some of the algorithms later in the book and found myself having to keep paging through earlier sections of the book to figure out what the data structures were supposed to look like. There was no centralized location from which I could pull this information, and in some cases the types/classes/routines were not available at all, and had to be inferred from the information that was present. Given the complexity of the C++ language when it comes to specifying data structures, this is a major flaw. Further, the lack of compilable code with well defined test cases makes it harder for the reader to verify there are no errors in the code samples that ARE provided.
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: Hardcover
It is strange to me why some people love this book so much. Admittedly, Sedgewick is very respected in his field and knows a lot about sorting algorithms, but his book is still dissapointing and very frustrating to read for a beginning computer science student. He seldom includes complete code in his examples, and where there is code, there are sometimes errors in the code.
This reviewer took Sedgewick's class at Princeton University where this book was the required text, and not only was the text poor, his lectures were terribly boring. He himself even recognized that there were errors in his book, and so he allowed his students and TA's to submit errors found in the book. At the end of the year, the list of references to mistakes in the book took up more than three pages.
This review is not the result of a student upset about his grade (an A is fine with me), but is rather an attempt to warn students about the potential pitfalls that may be encountered in reading Sedgewick's book. I suppose this could be a great book for an intermediate or advanced CS student who doesn't mind the sparse and sometimes erroneous code or the terse language used to describe fairly complex ideas. Also, there are some parts of the book that are well written and a pleasure to read. However, I would never recomend this book to anyone interested in learning algorithms for this first time without a fair amount of prior programming experience.
Comment 8 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
By A Customer on 18 Jan. 1999
Format: Hardcover
This book provides information on a wide variety of algorithms, from basic searching and sorting, to more advanced, mathematical material. While it does not go into as much depth as other texts, all ideas are explained in a clear and very readable manner. I highly recommend this book for any intermediate level programmer looking to gain a better perspective on a wide variety of algorithms.
Comment One person 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: Hardcover Verified Purchase
The book's content is organized in a bad way I think. The C++ code is horrible and is written in a bad and error prone way. The implementation of the data structures and algorithms is terrible. Sedgewick clearly didn't know C++ and the book was clearly published as a new version of the "Algorithms in C" book because C++ was hot at the time - a quick way to bank some bucks. I see no reason to use C++ to illustrate algorithms - use C, it's simpler and has less overhead for the reader.
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
Format: Hardcover
This book covers a wide variety of algorithms, ranging form basic sorting and searching to file compression and encryption. It's a wonderful text to learn about algorithms, not necessary data structure. In fact, it would be a good reference book for computer algorithm in general. This book, however, lacks any coding standard in its examples. In fact so of the code is not very self explanatory. For example, there's a plentiful usage of simplified variable names and unspecified and undeclared variables.
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: Hardcover
Finally a book that just cuts to the chase and gives you the building blocks for basic and advanced data structures and methods. The chapters are well written so that you won't feel too tired after reading one, and the code is pretty concise and readable. The book begins with elementary algorithms and data structures that should be under every programmer's belt before moving on to the good stuff: hash tables, graphs, n log(n) sorting algorithms, Red-Black trees, and really cool heap array implementations. If that wasn't enough for you, the book moves on to upper level undergrad type algorithms that will be useful in the future. I thought the chapter on Hash Tables was well written and easy to implement. Also, the chapter on Graphs was easy to understand with their pictures of various "trees" or "forests" that could form with nodes. I'd highly recommend reading the hash table chapter with the hash function "hashpjw" from the "Dragon Book."
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


Feedback