Skip to content

Utilizing graph algorithms including Dijkstra's Algorithm and Delta Step Algorithm to find shortest flight path between two arbitrary airports in the map efficiently

Notifications You must be signed in to change notification settings

HaiyueZhang/Flight-Schedule

Repository files navigation

Open Flights Final Project

  • Haiyue Zhang (haiyuez2) Shitao Shi (shi40) Raymond Wu (haozhen6)

Github Organization

  • This link is to our video demo.
  • Our primary file structure should look like this:
dir/
    data/
        input.dat
        input_detail.dat
        main.ipynb
        main.py
    documents/
        Contract.md
        Proposal.md
        log.md
        results.md
    src/
        Airport.cpp
        Airport.h
        BFS.cpp
        BFS.h
        Interaction.h
        interaction.cpp
        readFile.cpp
        readFile.h
    tests/
        testdata1.dat
        tests.cpp
    Makefile
    main.cpp
  • data stores raw data, cleaned data and data processing routine.
  • src contains all source code.
  • documents includes our contract, proposal, log and results.
  • tests contains all tests cases.

Running Instructions

Build and Run Main

$ make main && ./main

Build and Run Test

$ make test && ./test

Please see our video demo for running example.

About

Utilizing graph algorithms including Dijkstra's Algorithm and Delta Step Algorithm to find shortest flight path between two arbitrary airports in the map efficiently

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published