What is the algorithm for fast path finding in a graph?

Question

Algorithms

Tell me, what are the algorithms for quickly finding a path from entry to exit (of course, there are no entries and exits in the graph, you need to find a path between two vertices)? All the algorithms that I found are geared towards finding the optimal path, but none are geared towards the speed of issuing a solution, even if it is not optimal.

Answer 1

Look towards A*

Answer 2

If not minimal, then DFS will work for O (V + E), in your case for the number of edges in the connected component. It's graph reading time. Or do you need faster?

Answer 3

habrahabr.ru/post/162915

Answer 4

Dijkstra's algorithm