Introduction - If you have any usage issues, please Google them yourself
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 to v in the right smallest P* (u, v) is called shortest path u to v in.