本项目以图模型算法为基础,实现一系列末班车可达场景的应用。
Ref1. Hierarchical hub labelings for shortest paths
OpenSourceCode. akiba hhl
Ref2. Pruned Landmark Labeling
OpenSourceCode. akiba pll
Ref3. Efficient Index Structures for Reachability and Shortest Path
Ref4. Efficient Top-k Shortest-Path Distance Queries on Large Networks by Pruned Landmark Labeling