Items related to Algorithms in C, Part 5: Graph Algorithms
Synopsis
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.
"synopsis" may belong to another edition of this title.
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
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 this title" may belong to another edition of this title.
- PublisherAddison-Wesley Professional
- Publication date2001
- ISBN 10 0201316633
- ISBN 13 9780201316636
- BindingPaperback
- LanguageEnglish
- Edition number3
- Number of pages512
- Rating
Search results for Algorithms in C, Part 5: Graph Algorithms
Stock Image
Algorithms in C, Part 5: Graph Algorithms
Published by
Addison-Wesley Professional, 2001
ISBN 10: 0201316633
ISBN 13: 9780201316636
Used
Softcover
Seller: Seattle Goodwill, Seattle, WA, U.S.A.
Seller rating 5 out of 5 stars
Condition: Good. May have some shelf-wear due to normal use. Your purchase funds free job training and education in the greater Seattle area. Thank you for supporting Goodwills nonprofit mission! Seller Inventory # 0KVOTW0031UR
Quantity: 1 available
Seller Image
Algorithms in C, Part 5: Graph Algorithms
Published by
Addison-Wesley Professional, 2001
ISBN 10: 0201316633
ISBN 13: 9780201316636
Used
Softcover
Seller: Goodwill of Silicon Valley, SAN JOSE, CA, U.S.A.
Seller rating 4 out of 5 stars
Condition: good. Supports Goodwill of Silicon Valley job training programs. The cover and pages are in Good condition! Any other included accessories are also in Good condition showing use. Use can include some highlighting and writing, page and cover creases as well as other types visible wear. Seller Inventory # GWSVV.0201316633.G
Quantity: 1 available
Stock Image
Algorithms in C, Part 5: Graph Algorithms: Graph Algorithms Pt.5
Published by
Addison-Wesley Professional, 2001
ISBN 10: 0201316633
ISBN 13: 9780201316636
Used
Softcover
Seller: medimops, Berlin, Germany
Seller rating 5 out of 5 stars
Condition: very good. Gut/Very good: Buch bzw. Schutzumschlag mit wenigen Gebrauchsspuren an Einband, Schutzumschlag oder Seiten. / Describes a book or dust jacket that does show some signs of wear on either the binding, dust jacket or pages. Seller Inventory # M00201316633-V
Quantity: 1 available
Stock Image
Algorithms in C, Part 5 Pt. 5 : Graph Algorithms
Published by
Addison Wesley Professional, 2001
ISBN 10: 0201316633
ISBN 13: 9780201316636
Used
Softcover
Seller: Better World Books Ltd, Dunfermline, United Kingdom
Seller rating 5 out of 5 stars
Condition: Good. 3rd. Ships from the UK. Former library book; may include library markings. Used book that is in clean, average condition without any missing pages. Seller Inventory # 8416976-6
Quantity: 1 available
Stock Image
Algorithms in C, Part 5: Graph Algorithms 3rd Edition
Published by
Addison-Wesley, Reading, MA, 2001
ISBN 10: 0201316633
ISBN 13: 9780201316636
Used
Paperback
Seller: BookScene, Hull, MA, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: Good+. 3rd Edition. Paperback. Book Condition: Good+. Addison-Wesley, Reading, MA 2001. 3rd Edition. 512 pages. Moderate general wear. Size: 8vo 7.75 - 9.75'' tall. Computer Science 0437. Seller Inventory # 137663
Quantity: 1 available
Seller Image
Algorithms in C : Graph Algorithms
Published by
Addison-Wesley Professional, 2001
ISBN 10: 0201316633
ISBN 13: 9780201316636
Used
Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 60806
Quantity: Over 20 available
Stock Image
Algorithms in C, Part 5: Graph Algorithms
Published by
Addison-Wesley Professional, 2001
ISBN 10: 0201316633
ISBN 13: 9780201316636
Used
Paperback
Seller: SGS Trading Inc, Franklin Lakes, NJ, U.S.A.
Seller rating 4 out of 5 stars
Paperback. Condition: Good. Textbook, May Have Highlights, Notes and/or Underlining, BOOK ONLYNO ACCESS CODE, NO CD, Ships with Emailed Tracking. Seller Inventory # SKU0483884
Quantity: 2 available
Stock Image
Algorithms in C, Part 5 (Paperback)
Published by
Pearson Education (US), New Jersey, 2001
ISBN 10: 0201316633
ISBN 13: 9780201316636
New
Paperback
Seller: Grand Eagle Retail, Fairfield, OH, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: new. Paperback. Graph algorithms are increasingly critical for a wide range of applications, such as network connectivity, circuit design, scheduling, transaction processing, and resource allocation. In the third edition, many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. Graph algorithms are increasingly critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. This book focuses on graph algorithms, introducing many new implementations and figures, commentary, descriptions, and hundreds of new exercises. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780201316636
Quantity: 1 available
Seller Image
Algorithms in C : Graph Algorithms
Published by
Addison-Wesley Professional, 2001
ISBN 10: 0201316633
ISBN 13: 9780201316636
New
Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 60806-n
Quantity: Over 20 available
Stock Image
Algorithms in C, Part 5: Graph Algorithms
Published by
Addison-Wesley Professional, 2001
ISBN 10: 0201316633
ISBN 13: 9780201316636
New
paperback
Seller: BennettBooksLtd, North Las Vegas, NV, U.S.A.
Seller rating 5 out of 5 stars
paperback. Condition: New. In shrink wrap. Looks like an interesting title! Seller Inventory # Q-0201316633
Quantity: 1 available