Shortest path is a frequently used tool, particularly regarding route planning. But in some graph problems, the edges change as time progresses and so we can not use popular algorithms such as Djikstra. Instead we must use a class of algorithms which consider the properties of temporal edges.