Step by step
If you’re a programming wiz, you can get your own algorithm running in no time. It’s also step-by step illustrated, so you cannot go wrong. It also contains exercises and solutions. Solid!
Do it by hand
As mentioned above, in 1993, computing power was still in its infancy, and least cost path algorithms were still worked out by hand.
That is why the book comes with a large number of examples, fully illustrated and step by step iterative calculations. This is the way to learn algorithms…and how to program them.
Reference
Dolan, A. and Aldous, J. (1993) Introduction to Networks and Algorithms. London: Wiley & Sons
amazon
- amazon.com: Networks and Algorithms
Related
- husdal.com: Shortest path computation