--- A new way to look at the shortest path problem
The animation is also available on YouTube and Bilibili (in Chinese).
What is the shortest path from node A to node B?
This is a classic shortest path problem, with various classic algorithms available.
In this paper, I present a new algorithm: the "resonance algorithm".
In section 1, I explained the animation in details.
In section 2, I elaborated one way to implement by matrix (the following figure).
In the last section, I compare the resonance algorithm with the classic Dijkstra's algorithm, followed by some thoughts related to quantum mechanics and gravitational fields.