Temporal Shortest Path Algorithm
Deng Dong-me · 2014
The shortest path is a path which has the least hinder strength between two nodes in the specified network. Traditionally,it is studied on static network,but many networks are dynamic and temporal in real life.So the traditional algorithms can't solve all problems about shortest path.This paper presented a precision algorithm to find the temporal shortest path based on the Dijkstra's algorithm.It proved the correctness of the algorithm by mathematical derivation and verified the feasibility of the algorithm on a constructed network.