ICOM 4075 / CIIC 3075: Foundations of Computing

Bonus Problem The Shortest Path Problem

Overview

In this bonus problem, you will need to design and implement a Java program to
find the short path in a given graph.

Document requirements

To finish the problem, you will need to prepare three documents following the
guidelines below.

1. A design document
a. Cover page
i. It shall include the title of the document, your name,
student ID, department and university information,
etc.
b. Table of content
c. Background (Hint: read slides for chapters 10 and 11)
i. What is a graph?
ii. What is the shortest path problem?
iii. What is the Dijkstra algorithm?
iv. What is the Floyd-Warshall algorithm?
v. What is the BellmanFord algorithm?
d. The main idea of the shortest path algorithm you choose
e. The pseudo code of your shortest path algorithm
f. The complexity of your program
g. References
2. A Java source code
a. All methods shall be included in a single file
b. The program can read the graph topology from a text file
c. User can enter the source and destination node, the
program shall print the shortest path the consists of a
sequence of nodes from the source to the destination,
and also print the total distance of the path
3. A report for results and discussions
a. The text file content for the following graph to test
(distances are in units of km)
 WA
NY

IL
NE NJ
CA1 PA

UT DC
CO

CA2 GA
TX

b. The shortest path from NY to CA2

c. The shortest path from WA to GA
d. The shortest path from CA1 to NJ

Submission

Submit a single zip file that includes the design document, that Java
source code, and the report for results and discussions