Buy new:
$87.95
In stock
$$87.95 () Includes selected options. Includes initial monthly payment and selected options. Details
Price
Subtotal
$$87.95
Subtotal
Initial payment breakdown
Delivery cost, delivery date and order total (including tax) shown at checkout.
New & Used (7) from
$75.00  & FREE Delivery
Kindle app logo image

Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet or computer—no Kindle device required.

Read instantly on your browser with Kindle for Web.

Using your mobile phone camera, scan the code below and download the Kindle app.

QR code to download the Kindle App

Follow the author

Robert Sedgewick
Follow
Something went wrong. Please try your request again later.

Algorithms in C, Part 5: Graph Algorithms (3rd Edition) (Pt.5) Paperback – 16 August 2001

by Robert Sedgewick (Author)
4.5 out of 5 stars 21
Edition: 3rd
See all formats and editions
{"desktop_buybox_group_1":[{"displayPrice":"$87.95","priceAmount":87.95,"currencySymbol":"$","integerValue":"87","decimalSeparator":".","fractionalValue":"95","symbolPosition":"left","hasSpace":false,"showFractionalPartIfEmpty":true,"offerListingId":"beZQmXYYL3iHheyUw9vdVPOKS9W%2Bos7xw9tkwPZh%2FMEu%2BcBuPCb%2Bz3QToTz4%2BmA0KbR3yLq5dlIP1aABlRCUgZpT0aceVaCUoqh%2FIU4p%2F6B3CLx%2FU1eIWGOABal97lEskSRZBMQ0CS0yw6io1KnendtEIYfhmqt8","locale":"en-AU","buyingOptionType":"NEW","aapiBuyingOptionIndex":0}]}

Purchase options and add-ons

Previous page
  1. ISBN-10
    0201316633
  2. ISBN-13
    978-0201316636
  3. Edition
    3rd
  4. Publisher
    Addison-Wesley Professional
  5. Publication date
    16 August 2001
  6. Book 2 of 2
    Algorithms in C++
  7. Language
    English
  8. Dimensions
    19.69 x 3.81 x 23.24 cm
  9. Print length
    500 pages
  10. See all details
Next page

Frequently bought together

Algorithms in C, Part 5: Graph Algorithms (3rd Edition) (Pt.5)
$87.95
In stock
Ships from and sold by Amazon AU.
+
Algorithms in C, Parts 1-4: Fundamentals, Data Structures, Sorting, Searching: Fundamentals, Data Structures, Sorting, Search
$97.94
In stock
Ships from and sold by Amazon AU.
Total Price:
To see our price, add these items to your cart.
Details
Added to Cart
Choose items to buy together.

Customers who viewed this item also viewed

Page 1 of 1 Start againPage 1 of 1
Previous page
  1. Algorithms
Next page

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.

Product details

  • Publisher ‏ : ‎ Addison-Wesley Professional; 3rd edition (16 August 2001)
  • Language ‏ : ‎ English
  • Paperback ‏ : ‎ 500 pages
  • ISBN-10 ‏ : ‎ 0201316633
  • ISBN-13 ‏ : ‎ 978-0201316636
  • Dimensions ‏ : ‎ 19.69 x 3.81 x 23.24 cm
  • Customer Reviews:
    4.5 out of 5 stars 21

About the author

Follow authors to get new release updates, plus improved recommendations.
Robert Sedgewick

Robert Sedgewick

Brief content visible, double tap to read full content.
Full content visible, double tap to read brief content.

Robert Sedgewick (born December 20, 1946) is a computer science professor at Princeton University and a member of the board of directors of Adobe Systems.

Sedgewick completed his Ph.D. in 1975 under the supervision of Donald Knuth at Stanford. His thesis was about the quicksort algorithm. In 1975–85 he served on the faculty of Brown University.

Sedgewick was the founding Chairman (1985) of the Department of Computer Science at Princeton University and is currently still a Professor of Computer Science at Princeton. He was a visiting researcher at Xerox PARC, Institute for Defense Analyses and INRIA.

In 1997 Robert Sedgewick was inducted as a Fellow of the Association for Computing Machinery for his seminal work in the mathematical analysis of algorithms and pioneering research in algorithm animation.

Robert Sedgewick is the author of a well-known book series Algorithms, published by Addison-Wesley. The first edition of the book was published in 1983 and contained code in Pascal. Subsequent editions used C, C++, Modula-3, and Java.

With Philippe Flajolet he wrote several books and preprints which promoted analytic combinatorics, a discipline which relies on the use of generating functions and complex analysis in order to enumerate combinatorial structures, and to study their asymptotic properties. As explained by Knuth in The Art of Computer Programming, this is the key to perform average case analysis of algorithms.

He teaches four open online courses on the online learning platform Coursera, namely Algorithms Part I and Part II, Analysis of Algorithms and Analytic Combinatorics.

Bio from Wikipedia, the free encyclopedia.

Customer reviews

4.5 out of 5 stars
4.5 out of 5
21 global ratings

Review this product

Share your thoughts with other customers
Write a customer review

Top reviews from Australia

There are 0 reviews and 0 ratings from Australia

Top reviews from other countries

Hammar Rabia
5.0 out of 5 stars Five Stars
Reviewed in Canada on 30 March 2017
Verified Purchase
Report
Roman
5.0 out of 5 stars The absolute best Algorithm book
Reviewed in the United States on 7 March 2016
Verified Purchase
3 people found this helpful
 Report
Ivy league
5.0 out of 5 stars awesome.
Reviewed in the United States on 22 August 2013
Verified Purchase
3 people found this helpful
 Report
Juan Gabriel Gutierrez Alva
5.0 out of 5 stars very good
Reviewed in the United States on 7 June 2013
Verified Purchase
Report
YI
5.0 out of 5 stars Great Book
Reviewed in the United States on 6 March 2013
Verified Purchase
Report