Login

Graphs and Dijkstras algorithm (Java)

School project
Finished
09 November 2007

Oblig 5:

In this graph, you will use Dijkstra's algorithm and depth-first search. The result will be printed.

Task 1.
Make a file that looks like the example, and read this file into your program, when the file is read, the data structure for the graph will have to be updated.

Task 2.
Make an algorithm that traverses the graph and writes it out with shortest-not-weighed path from the start node S to all other nodes in the graph

Task 3.
Make an algorithm that traverses the graph and writes out the shortest weighed path from S to E.

Grade: B

You have to be logged in to download the project files!
If you are interested in the project files then contact me