A network of n nodes labeled $1$ to $n$ is provided along with a list of travel times for directed edges represented as $times[i]=(x_i​, \space y_i​, \space t_i​)$, where $x_i$​ is the source node, $y_i$ ...