Name		Name	Last commit message	Last commit date
Latest commit History 6 Commits
.settings		.settings
bin		bin
src		src
.classpath		.classpath
.project		.project
README.md		README.md

Repository files navigation

journey-planner-for-izmir-public-transportation

Java program that finds shortest way of 2 stops in Izmir.
The Dijkstra Algorithm was used to obtaine the shortest way.
All the stop identifications were included in Stop.txt

Usage

Give the start and stop identifications as input. The shortest way will be presented.

About

A program that finds the shortest way between 2 stops

java transportation dijkstra-algorithm journey-planner

Report repository

Releases

No releases published

Packages

No packages published

Languages

Java 100.0%