CS 6543 – Spring 2009

HW-04 – Due Date: March 27, 2009, 7pm

Best 2 of hw2, hw3, h4 will be counted.

!!! You must submit your hw using WebCT, no late HW will be accepted!!!

Total 100 points

Download the programs at

http://www.cs.utsa.edu/~korkmaz/teaching/cn-resources/programs/dijkstra/

You are asked to implement three procedures:  

(1) compute the shortest paths from a given node to all other nodes (i.e., implement dijkstra), 

(2)  print routing table at a given node, and

(3) print the shortest path between given src and dest.

NOTE THAT You only need to update/change the procedures in dijkstra.c

GRADING (Total grade will be 100 points.)

2. (50 points) Implementation (your modified dijkstra.c )

3. (50 points) Execution (give the output of your program for a few cases)

Please put all your documentation, source, output files under a directory called LASTNAME-hw4, then ZIP this directory as a single file and submit it using WebCT.

Please after submission, DO NOT change or delete your soft copies, we might execute them later together for grading….