Skip to content

A program that finds the shortest connection travel time between airports; uses an adjacency list structure for storing graphs.

License

Notifications You must be signed in to change notification settings

MinhQNguyen86/Flight_Route_Optimizer

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 

Repository files navigation

FlightRoute

This repository contains a java program that finds the shortest connection travel time
between airports, given a series of airport nodes and the time required to travel between them.

Commands

+ YYZ JFK 120 plane
(adds a connection from airport YYZ to airport JFK that takes 120 minutes using a plane)

- YYZ
(removes an airport from the database)

- YYZ JFK 120 plane
(removes a connection from airport YYZ to airport JFK that takes 120 minutes using plane)

? YYZ
(lists all connections from YYZ (lines in the format YYZ JFK 120 plane))

? YYZ LAX
(find the quickest route from YYZ to LAX; prints the total duration and then lists the individual connections for this option (lines in the format YYZ JFK 120 plane))

?
(list all connections in memory (lines in the format YYZ JFK 120 plane))

QUIT
(end the program)

About

A program that finds the shortest connection travel time between airports; uses an adjacency list structure for storing graphs.

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages