BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Algorithms in C, Part 5: Graph Algorithms

Algorithms in C, Part 5: Graph Algorithms

Algorithms in C, Part 5: Graph Algorithms
Stock photo: cover may vary

Algorithms in C, Part 5: Graph Algorithms Paperback - 2001 - 3rd Edition

by Sedgewick, Robert

Add to wish list
  • Used
  • Good
  • Paperback
Used - Good

Description

paperback. Good. Access codes and supplements are not guaranteed with used items. May be an ex-library book.
Ask the seller a question Add to wish list
A$73.32
Free Delivery within USA
Standard delivery: 7 to 14 days
More delivery options
Dropship order
Ships from Bonita (California, United States)

Details

  • Title Algorithms in C, Part 5: Graph Algorithms
  • Author Sedgewick, Robert
  • Binding Paperback
  • Edition number 3rd
  • Edition 3
  • Condition Used - Good
  • Pages 512
  • Volumes 1
  • Language ENG
  • Publisher Addison-Wesley Professional, Lebanon, Indiana, U.S.A.
  • Publication date 2001-08-16
  • Features Glossary
  • Bookseller's Inventory # 0201316633.G
  • ISBN 9780201316636 / 0201316633
  • Weight 2.1 lbs (0.95 kg)
  • Dimensions 9.2 x 7.7 x 1.2 in (23.37 x 19.56 x 3.05 cm)
  • Category Computers - Languages / Programming
  • Library of Congress Catalogue Number 9723418
  • Dewey Decimal Code 005.133
  • Quantity available 1

About Bonita California, United States

Biblio member since 2020

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Bonita

Reader reviews for Algorithms in C, Part 5: Graph Algorithms

From the publisher

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.

Media reviews

Citations

  • Scitech Book News, 12/01/2001, Page 27

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

tracking-