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

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

  • Robert Sedgewick Princeton University
Products list
$71.95 AUD

Price Reduced From: $79.95 AUD

Instant access

Access details

  • Digital eBook
  • Instant access
  • Available online, offline and via apps
  • Accessible through the VitalSource Bookshelf

Features

  • Make highlights and notes
  • Listen as the Bookshelf reads to you
  • Search across the eBook content
Products list
$72.71 AUD

Price Reduced From: $96.95 AUD

Free delivery

This product is expected to ship within 5-7 business days for Australian customers.

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.

  • 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