Transit-Dynamic-All-pair-Shortest-Paths

The code is written in C++ with the following files:

Route.h: Route class header file
StopClass.h: Stop class header file
Trip.h Trip class header file
Route, StopClass, and Trip source file provide the class codes corresponding to the header files
Functions.h: Walking distance calculation function
ShortestPath.h: Shortest path finding function
MultiThreading.h: functions for using multiple cores for calculation
CodeMain: the main code which reads the data file and find the weighted average travel time and dynamic all-pairs shortest path between stations for specified departure times

The link provided above links you to the paper that describes the calculation and algorithm in detail.

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
CodeMain.cpp		CodeMain.cpp
Functions.h		Functions.h
README.md		README.md
Route.cpp		Route.cpp
Route.h		Route.h
ShortestPath.h		ShortestPath.h
StopClass.cpp		StopClass.cpp
StopClass.h		StopClass.h
Trip.cpp		Trip.cpp
Trip.h		Trip.h
agency.txt		agency.txt
calendar.txt		calendar.txt
calendar_dates.txt		calendar_dates.txt
multi_threading.h		multi_threading.h
population.csv		population.csv
routes.txt		routes.txt
shapes.txt		shapes.txt
stop_times.txt		stop_times.txt
stops.txt		stops.txt
trips.txt		trips.txt

Provide feedback