Using and applying decision mathematics
Web Links
Links to websites you may find useful for this FSMQ are given below. The addresses and content of websites sometimes change. If you have any problems please contact June Haighton.
Automobile Association
AA Route Planner – gives distances and estimated times as well as directions and maps.
http://www.theaa.com/travelwatch/planner_main.jsp
MathsNet
A variety of animations and interactive examples for students to try. Includes Dijkstra’s, Prim’s and Kruskal’s algorithms and critical path analysis.
http://www.mathsnet.net/asa2/2004/d1.html
National Rail Enquiries
To download schematic maps of rail networks in England, Scotland and Wales.
http://www.nationalrail.co.uk/tocs_maps/maps/network_rail_maps.htm
Tokushima University
Set of Java applets demonstrating Dijkstra’s algorithm
http://www-b2.is.tokushima-u.ac.jp/~ikeda/suuri/dijkstra/Dijkstra.shtml
University of Edinburgh - a Eulerian cycle
Definition and animation of a Eulerian cycle.
http://www.cs.sunysb.edu/~skiena/combinatorica/animations/euler.html
University of Edinburgh - Dijkstra and an animation of his algorithm
Information about Dijkstra and an animation of his algorithm.
http://www.dcs.ed.ac.uk/home/stg/pub/G/graph.html
University of Edinburgh - a minimum spanning tree
Definition and animation of a minimum spanning tree.
http://www.cs.sunysb.edu/~skiena/combinatorica/animations/mst.html
University of New York
Animation of Dijkstra’s algorithm in a network whose edge weights are proportional to their lengths.
http://www.cs.sunysb.edu/~skiena/combinatorica/animations/dijkstra.html
University of North Florida
Java applet demonstration of Kruskal’s algorithm.
http://www.unf.edu/~wkloster/foundations/KruskalApplet/KruskalApplet.htm
University of Patras - Kruskal’s algorithm
Set of networks and animated step by step applications of Kruskal’s algorithm.
http://students.ceid.upatras.gr/~papagel/project/kruskal.htm
University of Patras - Prim’s algorithm
Set of networks and animated step by step applications of Prim’s algorithm.
http://students.ceid.upatras.gr/~papagel/project/prim.htm
University of Saskatchewan
Allows you do draw your own network and then shows a step by step application of Prim’s algorithm. Also provides an example for the comparison of Kruskal and Prim’s algorithms.
http://www.cs.usask.ca/resources/tutorials/csconcepts/1999_8/tutorial/advanced/prim/prim_kruskal.html
University of Toronto
Java applets demonstrating Dijkstra’s algorithm
http://www.dgp.toronto.edu/people/JamesStewart/270/9798s/Laffra/DijkstraApplet.html