hw3 - Assignment 3: Due date April 24th Write a Java...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Assignment 3: Due date April 24th Write a Java program to implement Dijkstra’s shortest path algorithm. As- sume that the description of the graph is in a file called “input”. The input file has the format described below. Assume that vertices are numbered from 1 to n . The first line of the input file contains the number of vertices in the graph. The description of each edge occupies 3 lines: the first 2 lines indicate the vertices involved in forming the edge. The 3rd line indicates the weight on that edge. Each edge is specified only once. The end of file is indicated with a 0. Your program will ask for two inputs: the starting vertex (a number
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/12/2009 for the course SE 3306 taught by Professor Nhut during the Spring '09 term at University of Texas at Dallas, Richardson.

Ask a homework question - tutors are online