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
  • very good
  • Paperback
Used - Very good

Description

Addison-Wesley Professional, 2001-08-16. Second Printing. paperback. Very Good. 7x0x9. Second Printing, 2002. Matte paper covers; mild wear; 8vo, 7 3/4" to 9 3/4" tall; interior is clean and unmarked; last 60 pages creased along fore edge; 482 pages.
Ask the seller a question Add to wish list
A$20.95
A$9.20 Delivery within USA
Standard delivery: 5 to 10 days
More delivery options
Ships from A Squared Books (Michigan, United States)
The BIBLIO Guarantee

Details

  • Title Algorithms in C, Part 5: Graph Algorithms
  • Author Sedgewick, Robert
  • Binding Paperback
  • Edition number 3rd
  • Edition Second Printing
  • Condition Used - Very 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 # SKU1178308
  • 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)
  • Size 7x0x9
  • Category Computers - Languages / Programming
  • Library of Congress Catalogue Number 9723418
  • Dewey Decimal Code 005.133
  • Quantity available 1

About A Squared Books Michigan, United States

Specialising in: Americana, Architecture, Art, Engineering, Mathematics, Photography, Technical
Biblio member since 2006

Closed shop.

Terms of Sale: Unconditional return for 7 days after receipt. Purchase price refunded. If book not as described, purchase price and shipping fee is refunded.

Browse books from A Squared Books

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

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

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

Please wait a moment while we load the requested page.

tracking-