What algorithm for finding the shortest path is applicable for finding the path at the railway station between two arrows?

Question

Algorithms

Hello!
It is necessary to find the shortest path between the two arrows at the railway station. If we consider the station from the point of view of graph theory, then it will be a weighted undirected graph, where the weights of the edges are the distance between the arrows.
I am considering the following algorithms - dynamic programming, wave, A*. Which one would suit better?
Is it necessary to represent the station as a graph at all? After all, if I understand correctly, for example, for the wave algorithm it is not necessary that the input data be presented in the form of a graph.
On the other hand, it is important for me that the algorithm takes into account the weight of the edges, if it is an algorithm that works on a graph. Therefore, I ask you to suggest which algorithm would be better to apply in my case. Thanks in advance.

Answer 1

A* is perfect.