 |
 Sponsored Sites |
|
|
 |
|
Graph Algorithms (3rd Edition)
Author: Robert Sedgewick
Paperback: 528 pages
Publisher: Addison-Wesley Professional; 3 edition (July 25, 2003)
Language: English
ISBN-10: 0201361213
ISBN-13: 978-0201361216
Format: chm
Details:
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.
The Web site for this book
www.cs.princeton.edu/~rs/
provides additional source code for programmers along with a variety of academic support materials for educators.
| Don't wait, download now!
|
Download :
http://rapidshare.com/files/109546047/Algo.in.J.3rd.Ed.P5.Graph.Algo-virTuAlZin.rar
Note: Must have WinZix to open this file! Get WinZix here!
|
