Verification of the urban public transport for the permissible number of transfers

The article is devoted to the development of a software tool for determining the transfer connectivity of the urban public transportation route network. The transfer connectivity is understood here as the number of transfers that a passenger needs to make in order to travel by public transport between two stops in the city. Such indicator is used in the social standard of public transportation service. The paper proposes algorithms to calculate the transfer connectivity for any pair of stop points in the city route network. For this purpose, the route network is transformed into a graph and the Dijkstra shortest path search algorithm is used. The software implementation is done in Python programming language using NetworkX library. The developed tool was applied to analyze the route network of the city of Yekaterinburg. Among other things, it was found that more than 99.9% of inter-stop correspondences in this city meet the requirements of the social standard.