State the optimal route of node
Consider the node i which has path length K+1, with the directly preceding node on the path being j. The distance to node i is w(j, i) plus the distance to reach node j. This latter distance must be L(j), the distance to node j with the optimal route, because or else there would be a route with shorter distance found by going to j with the optimal route and then directly to i.