Transit algorithm implementation
Implementation of a state-based algorithm to preprocess transit shortest paths in a city-based graph using schedule tables and a maximum of two connections allowed.
Implementation of a state-based algorithm to preprocess transit shortest paths in a city-based graph using schedule tables and a maximum of two connections allowed.