Web Links for Chapter 4 Network Algorithms Dr. Lee Eimers

---

Web Links:

All Pairs Minimum Routes Problem
    Good discussion of Floyd's algorithm, plus an excellent
    applet implementation that shows process, step-by-step.
    By Papagelis Athanasios, University Of Patras, Greece
Dijkstra's Algorithm
    A brief introduction to a version of the the method,
    along with some applet demos,
    by Kenji Ikeda, Tokushiam Univ., Japan.
Flow Problems
    An introduction to network flows.
    University of Saskatchewan
Graph Theory Lessons
    A set of lessons on various topics in graph theory,
    especially Lesson 13: Trees and Searches; Lesson 20: Spanning Trees; and
    Lesson 23: Weighted Graphs, Shortest Paths, and Minimal Spanning Trees
    by Christopher P. Mawata
    University of Tennessee at Chattanooga
Graphs and Graph Theory
    Links to definitions of words used in graph theory,
    by MegaMathematics , Los Alamos National Lab .
Overview on Graph Theory
    A survey of basic ideas and terms of the subject,
    from Leibniz Laboratory, The Graph Theory Team
    (part of the IMAG Institute, Grenoble, France).
The Network Flow Problem
    Chapter 3 (p. 63ff) from a book Algorithms and Complexity
    (by Herbert S. Wilf, University of Pennsylvania),
    which is very good, but kind of high-powered for us,
The Network Flow Problem
    Nice introduction, with worked examples.  
    By Russell C. Bjork, Gordon College.
Prim's Algorithm
    Introduction and applets.  By Kenji Ikeda,Tokushima Univ.
Prim's Algorithm
    Introduction, proof, and nice applet.  By Eric Seidel.
Unifying Model: Minimum Cost Network Flows
    A higher level approach to flows,
    by Michael A. Trick, Carnegie Mellon Univ.