Algorithm A * with Euclidean distance

Question

If I have a set of nodes with coordinates (x, y), and I have a set of node - node - cost, in this case the cost will be per minute. How to calculate the Euclidean distance if the speed is constant ...

One metric is in minutes, and distance using x, y is not included in the time metric

Answer 1

I personally recommend this tutorial . He taught me how to implement A * in a game that I made several years ago.

Also, the wikipedia page is always good for links! :)