The tree τ consists of the edges not in T. The algorithm tries to transform T into a shortest-path tree by pivoting into T unrelaxed darts according to some ...
確定! 回上一頁