How to provide Euclidean distance heuristic for AStar algorithm

Topics: algorithm
Apr 28, 2011 at 5:09 PM

First big thanks to Jonathan de Halleux and other contributors for this excellent libary. I am having a problem implementing a Euclidean distance heuristic using Astarshortestpath. Looks to me costHeuristic is in this format Func<TVertex, double> costHeuristic, only takes one (target) vertex as input.

I have stored x and y information in my vertex, how do I return the source and target distance based on euclidean formula.  Appreciate anyone's help.

thank you

Apr 29, 2011 at 4:45 AM

By looking more, I figured it out myself. thanks anyway

Jun 9, 2011 at 7:47 PM

can you post your solution?