Algorithms in C++ Part 5: Graph Algorithms - Softcover

Sedgewick, Robert

  • 4.27 out of 5 stars
    30 ratings by Goodreads
 
Image Not Available
Softcover
ISBN 10: 0201361183 ISBN 13: 9780201361186
Publisher: Addison-Wesley Professional, 2001

Synopsis

Graph algorithms are critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. The latest in Robert Sedgewick's classic series on algorithms, this is the field's definitive guide to graph algorithms for C++. Far more than a "revision," this is a thorough rewriting, five times as long as the previous edition, with a new text design, innovative new figures, more detailed descriptions,...

More

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

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...

More

"About this title" may belong to another edition of this title.

  • PublisherAddison-Wesley Professional
  • Publication date2001
  • ISBN 10 0201361183
  • ISBN 13 9780201361186
  • BindingPaperback
  • LanguageEnglish
  • Edition number3
  • Number of pages528
  • Rating
    • 4.27 out of 5 stars
      30 ratings by Goodreads