CS73 - Djikstra's Least Cost Algorithm 

Implement Djikstra's algorithm using the description found in appendix 9A 
of Stallings.  Your program should read a file which describes a network 
using the following format:

	node1 node2 link_cost
	node3 node4 link_cost
	node2 node4 link_cost
	...
	
Assume that the files describe a logically complete and reasonable network.  
This includes networks that may have more than one link between two given 
nodes.  Each link has one cost associated with it which should be used 
for calculations in either direction.  

You can find two data files for testing at ~charliep/www/classes/cs73/src
There are two files, one.net and two.net

I would prefer you to use C for this assignment although I will accept 
Perl or Java as well.  

You should turn-in a printout of the source code and a printout of the 
generated routing tables, one set for each of the data files I provided. 
The output should display the routing table for each node in the network 
in a clear and easy to understand format.  It should also include the 
name of the input file that described the network for which you are 
generating the routing tables.  

Remember that it's much easier and better to design good data structures, 
algorithms, naming conventions, and program structure than it is to put 
comments all through bad code.

When designing your data structures and algorithms try to consider what 
would be involved to add additional dimensions to the link cost parameter.  
Time of day, current load, etc.  While you don't have to do that for this 
assignment if your design can support it you would have a very powerful 
tool with those extensions.