Global Optimization Principle for Internet IP Route entries per hop-Dijkstra algorithm proof

Global Optimization Principle for Internet IP Route entries per hop-Dijkstra algorithm proof
I made up half of what I wrote over the weekend and achieved a perfect day.

The question of skip-by-Skip global optimization is as follows:

The following is a simple proof of global optimization for a hop-by-hop model. There are many ways to prove the global optimization. Here I only provide one of them:

The traces of penetration will understand the Dijkstra algorithm, which is indeed self-evident. Nature is lazy and always acts in the most effort-saving way. water molecules start to land at that point, on uneven ground due to gravity (not considering other molecular forces for the time being) the path must be the shortest path. We can regard the rugged ground as the path weight. Isn't this exactly the same as the Dijkstra Algorithm Model?