The team proposed Graph-Decomposed k -NN Searching Algorithm to improve the time-efficiency of nearest nodes searching. In the research, A graph-decomposed tree is constructed from road network.

If you haven't heard of Dijkstra's algorithm before, the idea is that the algorithm can be used to calculate the shortest path between two locations. In the project designed by Eveleigh, the idea ...