设P(u,v)是加权图G中从u到v的路径,则该路径上的边权之和称为该路径的权,记为w(P). 从u到v的路径中权最小者 P*(u,v)称为u到v的最短路径. -Set P (u, v) is a weighted graph G path u to v, then the right side of the path and the path is called right, denoted w (P). The path u