CSC 269 Programming Project
Using Dijkstra's Algorithm
Due Friday August 16, 2002

This programming assignment is dedicated to Edsger W. Dijkstra

• If you use "off the shelf" code from any source, please cite the source.
• Write a program that, given a weighted directed graph G and a start vertex s, computes the minimum weight path from s to all vertices reachable from s.
• The input file of your program will be a text file containing any number lines, each line containing one edge of a weighted directed graph. The edges are listed in arbitrary order.
• Here is the output given this small graph, and s = 0.
  For example, the line
  0000 0003 0002 0004 0005 (10)
  means that the shortest path from 0000 to 0005 is (0000,0003,0002,0004,0005) and has weight 10.
• Here is the output , given this larger graph and given that s = 0265.
• Clues.