Algorithms in C (Part 5, Graph Algorithms)

Автор: Bookstream от 18-08-2020, 09:23, Коментариев: 0

Категория: КНИГИ » ПРОГРАММИРОВАНИЕ

Algorithms in C (Part 5, Graph Algorithms)
Название: Algorithms in C (Part 5, Graph Algorithms)
Автор: Robert Sedgewick
Издательство: Addison-Wesley
Год: 2002
Формат: pdf
Страниц: 482
Размер: 10 Мб
Язык: English

Graph algorithms are increasingly critical for a wide range of applications, including network connectivity, circuit design, scheduling, transaction processing, and resource allocation. The latest book in Robert Sedgewick's classic series on algorithms focuses entirely on graph algorithms, introducing many new implementations and figures, extensive new commentary, more detailed descriptions, and hundreds of new exercises. For developers, researchers and students alike, this is the definitive guide to graph algorithms.

The book contains six chapters covering graph properties and types, graph search, directed graphs, minimal spanning trees, shortest paths, and networks -- each with diagrams, sample code, and detailed descriptions intended to help readers understand the basic properties of as broad a range of fundamental graph algorithms as possible. The basic properties of these algorithms are developed from first principles; discussion of advanced mathematical concepts is brief, general, and descriptive, but proofs are rigorous and many open problems are discussed. Sedgewick focuses on practical applications, giving readers all the information and real (not pseudo-) code they need to confidently implement, debug, and use the algorithms he covers. For all developers, computer science researchers, engineers, and students of algorithms.

Скачать "Algorithms in C (Part 5, Graph Algorithms)"









Нашел ошибку? Есть жалоба? Жми!
Пожаловаться администрации
Уважаемый посетитель, Вы зашли на сайт как незарегистрированный пользователь.
Мы рекомендуем Вам зарегистрироваться либо войти на сайт под своим именем.
Информация
Посетители, находящиеся в группе Гости, не могут оставлять комментарии к данной публикации.