A* algorithm with euclidean distance

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 is in minute. How do I calculate the Euclidean distance assuming the 开发者_如何学运维speed is constant...

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

I personally recommend this tutorial. It taught me how to implement A* in a game I made a few years back.

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