I have a first data set which is a list of train stops with coordinates (lat, lon), but not the "links" between the nodes/stops (this could thought of as a null or empty graph).

I have a second data set which has the start / end stop coordinates of a particular train line and also intermediary stopping points. However the data for the train line is missing some of the intermediary stops, so parts of the trip are represented as straight line segments which pass more or less closely by the missing intermediary train stops coodinates from the first data set.

What kind of (pathfinding?) algorithm would allow me to infer from this data set the full path of the train ? I've heard about pathfinding algos like A*, breath-first-search, etc. but i'm not sure if these can be applied to this particular problem.

Thanks for any help or tips you can provide. Regards,