menu
{ "item_title" : "Algorithms in C, Part 5", "item_author" : [" Robert Sedgewick "], "item_description" : "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, that has made his work popular with programmers for many years.Alogrithms 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 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.The coverage here includes:A complete overview of graph properties and typesDiagraphs and DAGsMinimum spanning treesShortest pathsNetwork flowsDiagrams, sample C code, and detailed algorithm descriptionsThe Web site for thia book ( http://www.cs.princeton.edu/~rs/ ) provides additional source code for programmers along with a wide range of academic 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.0201316633B07052001", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/0/20/131/663/0201316633_b.jpg", "price_data" : { "retail_price" : "69.99", "online_price" : "69.99", "our_price" : "69.99", "club_price" : "69.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Algorithms in C, Part 5|Robert Sedgewick

Algorithms in C, Part 5 : Graph Algorithms

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

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, that has made his work popular with programmers for many years. Alogrithms 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 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. The coverage here 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 thia book ( http://www.cs.princeton.edu/~rs/ ) provides additional source code for programmers along with a wide range of academic 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. 0201316633B07052001

This item is Non-Returnable

Details

  • ISBN-13: 9780201316636
  • ISBN-10: 0201316633
  • Publisher: Addison-Wesley Professional
  • Publish Date: August 2001
  • Dimensions: 9.2 x 7.7 x 1.2 inches
  • Shipping Weight: 2.1 pounds
  • Page Count: 512

Related Categories

You May Also Like...

    1

BAM Customer Reviews