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

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

  • Robert Sedgewick Princeton University
Products list
$77.35 NZD

Price Reduced From: $85.95 NZD

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
$71.99 NZD

Price Reduced From: $95.99 NZD

Free delivery

This product is expected to ship within 10-12 business days for New Zealand customers

Title overview

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.


Table of contents

  • 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