CT243 lab6
http://geminga.it.nuigalway.ie/~gettrick/courses/CT243/labs/l6.html
-
For this lab you must submit
-
Handwritten development notes, including statement of the problem, analysis of the problem, algorithm design (which may include flow charts).
-
A printout of form, image and code of your program, and any numerical answers requested.
-
The above material should be given to David or left in the cardboard box marked CT243 in the mail room (room IT415) on the 4th floor of the IT Building
before
the deadline of 5pm
Monday 10th March 2008. You will lose 20% for each day
(or part of day) the lab is late.
Consider the (road) network pictured below
with 6 cities labelled A, B, C, D, E, F. You can ignore the direction
of the arrows and assume all roads are "two way". Starting with a matrix
(2-dimensional array) A of size 6x6, use the Dynamic Programming method,
using iteration
and Floyds Algorithm, to find the shortest route between any two cities.
As well as finding the length of the shortest route, your function should
return also the actual route (sequence of cities) in an appropriate data
structure.
©
NUI, Galway