Skip to content

Prolog based script aimed to find all (and fastest) routes from and to a city for a given day.

Notifications You must be signed in to change notification settings

Rosyparadise/Connecting-flights

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 

Repository files navigation

Route function finds every unique and acyclic connection of flights.

  1. Param1: departure
  2. Param2: destination
  3. Param3: day
  4. Param4: Route (variable in which the answers are saved)
  5. Param5: DeptTime (returned variable that specifies the time of departure)
  6. Param6: ArrTime (returned variable that specifies the time of arrival)
  7. Param7: TotalLength (total length of the trip)

best_route returns the trip that takes the least amount of time to complete. The parameters remain unchanged except the 4th one which now returns the best route(s).

About

Prolog based script aimed to find all (and fastest) routes from and to a city for a given day.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages