Finding shortest distances in a graph is one the fundamental problems in computer science with numerous applications (route planning by CityMapper and Google/Yandex-maps, for example). You have ...

Implementations are for learning purposes only. They may be less efficient than the implementations in the Python standard library. Use them at your discretion.

Abstract: Counting the number of shortest paths between two query vertices on road networks has a wide range of applications and has recently drawn significant research attention. The state-of-the-art ...

Abstract: With the rapid development of drone applications in mountain patrol, there is an increasing demand for intelligent flight capabilities of drones. This paper first established a Wolf Pack ...