Algorithms in C++: Part 5: Graph Algorithms
Автор:
Robert Sedgewick, Christopher J. Van Wyk, 528 стр., издатель:
"Pearson Education, Addison Wesley", ISBN:
978-0-201-36118-6, 0-201-36118-3
"Algorithms in С++: 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 С++ code, and detailed algorithm descriptions. A landmark revision, "Algorithms in С++: Part 5" provides a complete tool set for programmers to implement,...
В наличии: |
|
OZON.ru - 1596 руб.
|
Перейти
|
|
|
Рейтинг книги:



4 из 5,
1 голос(-ов).