A Shortest Path Algorithm With Minimum Number Of Nodes Traversed

Question

I am looking for a Dijkstra\'s algorithm implementation, that also takes into consideration the number of nodes traversed.

What I mean is, a typical Dijkstra\'s algo

Answer 1

I'm going to go out on a limb here, but have you tried the A* algorithm? I may have understood your question wrong, but it seems like A* would be a good starting point for what you want to do.

Check out: http://en.wikipedia.org/wiki/A*_search_algorithm

Some pseudo code there to help you out too :)