Mensys Online Shop

Algorithms in C++, Third Edition - Part 5: Graph Algorithms

Categorie:Algemeen - Boeken Van:Addison Wesley US
Meer informatie:www.awprofessional.c...Auteur(s):Robert Sedgewick
Bladzijden:496Publicatie-jaar:2002

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. 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  » Lees meer... Algorithms in C++, Third Edition - Part 5: Graph Algorithms

Selecteer een of meer artikelen en klik dan op Bestellen. Aantallen kunnen op de volgende blz. gewijzigd worden.
Partnr.OmschrijvingEuro *Euro incl. BTW 
F38763 Algorithms in C++, Third Edition - Part 5: Graph Algorithms27.2628.90

Alle prijzen zijn in Euro excl. BTW (19%, voor boeken 6%) en excl. verzendkosten.
E-mail of bel 023 548 20 20 voor licenties, upgrades en andere vragen.

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. 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 a wide range of academic support materials for educators.