Algorithms in C, Part 5: Graph Algorithms, 3rd edition

Published by Addison-Wesley Professional (August 16, 2001) © 2002

  • Robert Sedgewick Princeton University
Products list
  • Available for purchase from all major ebook resellers, including InformIT.com
Products list

Details

  • A print text
  • Free shipping
  • Also available for purchase as an ebook from all major ebook resellers, including InformIT.com

This product is expected to ship within 3-6 business days for US and 5-10 business days for Canadian customers.

Products list

Details

  • A print text

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. Source code for the implementations is available via the Internet.

  • Preface.
  • Notes on Exercises.
  • 17. Graph Properties and Types.
  • 18. Graph Search.
  • 19. Digraphs and DAGs.
  • 20. Minimum Spanning Trees.
  • 21. Shortest Paths.
  • 22. Network Flows.
  • References for Part Five.

Need help? Get in touch