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.
“Knowledge Must be Free”, so it is freely provided many Windows Tricks / Tips and free Softwares for educational purposes and self-practice only. However, you should agree to Disclaimer & Agreements mentioned herein. Moreover, all the materials here, are really hard works of mine or someone else, you should appreciate & respect these hard works.
Wednesday, June 18, 2008
Algorithms in Java, Part 5 Graph Algorithms
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.
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment