Algorithms in C, Part 5: Graph Algorithms

By: Sedgewick, Robert

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.

• Format: Paperback
• Language: English
• ISBN: 0201316633
• ISBN13: 9780201316636
• Release Date: August 2001
• Publisher: Addison-Wesley Professional
• Length: 512 Pages
• Weight: 1.80 lbs.
• Dimensions: 1.2" x 7.7" x 9.2"

Customer Reviews

Attention : These are NOT reviews for part 5

Just wanted to let everyone know that the reviews here (till 6th March 2002 at any rate) are not of the book 'Algorithms in C++ part 5 graph algorithms' by Robert Sedgewick, but of the earlier edition of his book on algorithms. To get an idea of the book it's supposed to be about, please refer to the review(s) on 'Algorithms in C part 5 graph algorithms', which i expect to identical but for the code. It'd be...

Great for Algorithms, perhaps not for C++ implementations

This is easily one of the leading texts on data structures and algorithms - a third edition has already been released (however, that is practically a new book ,so read on :-)...). Sedgewick is a student of the great Donald Knuth, and a leading researcher and authority in the field of Algorithmics.'Pound for pound', this might be as good as Cormen et al's classic, which is the undisputed leader among introductory books on algorithms...

If you want algorithms, you want this book

The code isn't very easy to read (the only downfall), but it is efficient, and that's what I want.. Take the book Introduction to Algorithms, take out the math, squish it and you have Alg in C++. It's really C, not C++, code but `C++' isn't its real purpose, `Algorithms' is. If you want to learn a plethora of computer algorithms, this book will give it to you. Bottom line.

Clean and Clear book

The source codes was written in a precise condense way and are intelligible. The content was well arranged.

Greatest Book Known to Man!

Comes in handy for tests at school and great resource for programming issues concerning sorts and searches!