Algorithms in C

Robert Sedgewick

482 pages, parution le 15/09/2000 (3^eme édition)

Ajouter à une liste

Indisponible

Résumé

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

Table des matières

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.
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	15/09/2000
Édition	3^eme édition
Nb. de pages	482
Format	19,5 x 23,3
Couverture	Broché
Poids	797g
Intérieur	Noir et Blanc
EAN13	9780201316636
ISBN13	978-0-201-31663-6