This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: University of Arizona CSc345 (Fall 2011; B. Moon) CSc 345 Programming Assignment #3 Airline Travel Scheduler Problem Statement There are numerous application domains where problems and tasks are formulated by graphs. The purpose of this programming assignment is to practice graph theory by applying a shortest path algorithm to a real- life problem. You will implement Dijkstras single-source shortest path algorithm to develop an airline travel scheduler. The airline travel scheduler will find an itinerary ( i.e. , a sequence of flights) that allows one to depart from an origin airport and arrive at a destination airport at the earliest possible time. Requirements & Implementation You will be given two tables as input: airport table and flight table . The airport table consists of a set of airports with each of which a minimum connecting time is associated. The flight table consists of a set of flights, and for each flight, the following information: departure and destination airports, departure time, and arrival time. In addition, an airline traveler (or customer) will submit to the scheduler (1) an origin airport, (2) a final destination airport, and (3) his/her earliest departure time from the origin airport. We will use the flight information obtained from real-world commercial carriersfrom the origin airport....
View Full Document
This note was uploaded on 02/28/2012 for the course CSC 345 taught by Professor Moon during the Fall '11 term at University of Arizona- Tucson.
- Fall '11