Algorithms in Java

Part 5 : Graph Algortithms

Robert Sedgewick

498 pages, parution le 01/08/2003 (3^eme édition)

Ajouter à une liste

Indisponible

Résumé

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 that has made his work popular with programmers for many years. Michael Schidlowsky and Sedgewick have developed concise new Java implementations that both express the methods in a natural and direct manner and also can be used in real applications.

Algorithms in Java, 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. The natural match between Java classes and abstract data type (ADT) implementations makes the code 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 Java code, and detailed algorithm descriptions

A landmark revision, Algorithms in Java, 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.

Graph Properties and Types
Graph Search
Digraphs and DAGs
Minimum Spanning Trees
Shortest Paths
Network Flow

References for Part Five
Index

L'auteur - Robert Sedgewick

Robert Sedgewick , spécialiste des algorithmes mondialement reconnu, dirige le département d'informatique de l'université de Princeton.

Caractéristiques techniques

	PAPIER
Éditeur(s)	Addison Wesley
Auteur(s)	Robert Sedgewick
Parution	01/08/2003
Édition	3^eme édition
Nb. de pages	498
Format	19,5 x 23,5
Couverture	Broché
Poids	795g
Intérieur	Noir et Blanc
EAN13	9780201361216
ISBN13	978-0-201-36121-6