一种“最优解”的递归定义方式 Now,letbe the minimum weight of any path from vertexito vertexjthat contains at most m edges. When m =0,there is a shortest path from i to j with no edges if and only if i=j.Thus, ifi=j, oifi卡j.一种“最优解”的递归定义方式