Skip to content

Final project of Data Structures and Algorithms course at AUT.

Notifications You must be signed in to change notification settings

Amirparsa-Sal/Dijkstra-Path-Finding

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Dijkstra-Path-Finding

This is my final project of Data Structures and Algorithms course at AUT.

I used Java for implementing Dijkstra algorithm on a directed graph with weighted edges and Python for visualizing the chosen path for each passenger. It considers the real time traffic of streets and estimates transportation time for each transportation.

Capture

Compiling and Running With JDK

Run this command in project root folder to compile the project:

javac -d classes -sourcepath src src/*.java

And to run the program:

java -cp classes RouteFinder

How to use

Once you run the program, you should select a map text file to create a graph based on that map. There are some examples in Maps folder and you can use m?.txt files as a map. maps text file template is like this:

<number of vertices> <number of edges>
<first vertex ID> <first vertex latitude> <first vertex longitude> 
...
<last vertex ID> <last vertex latitude> <last vertex longitude>

After choosing the map, you should determine the number of transportations and after that you can query transportations like this:

<start time> <source vertex> <destination vertex>

you can see some examples in test.txt files in Maps folder.

About

Final project of Data Structures and Algorithms course at AUT.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published