|
Note: in step 3, the path p can be found using a shortest path computations, depending on the set of paths P. For example, if P contains all paths going from si to ti for some set of pairs of vertices {(s1,t1), (s2,t2), …, (sk, tk)}, then the path can be found using k shortest path computations. |