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.