Is it possible to implement an algorithm for finding the shortest path for a large number of graph vertices with minimal running time?

Question

Algorithms

Hello!
There is a small project, the essence of which is something like creating a simplified version of Simulink. My task is to formulate an algorithm for automatically creating communication lines between blocks with bypassing obstacles in the form of other blocks and lines. In fact, this is just the task of finding the shortest path along the graph (pathfinding). I tried using the Lee Wave Algorithm, A* Algorithm, but all of them are not fast enough for this size of the graph (the working field is presented in the form of a table and consists of the number of cells equal to the width of the window multiplied by the height).
Is there any algorithm capable of finding the shortest path on a large table without delay? Path calculations will occur quite often - when moving the cursor.

Answer 1

The most efficient pathfinding algorithms are already known and are in the public domain. No one has a secret way that works faster than the known ones. Try to somehow reduce the number of vertices, for example, exclude obviously incorrect nodes from the bypass.