Researchers achieve ‘absurdly fast’ algorithm for network flow
I've been wondering if there is a connection between Lagrangian Mechanics/Calculus of Variations and Dijkstra's shortest path algorithm.<p><a href="https://profoundphysics.com/lagrangian-mechanics-for-beginners/" rel="nofollow">https://profoundphysics.com/lagrangian-mechanics-for-beginne...</a>
How you would translate from the discrete, relational approach to the continuous, analytic one?