Uses Dijkstra's shortest path algorithm to compute the shortest time taking path from any node to node node in a network. Also takes care of the node ups, node downs, edge ups and edge downs