Hello,
What is the simpliest proof of Dijkstra's Algorithm ?

Like for Euclidean algorithm, we can just say gcd(a,b)=gcd(b,r) and we're done.