d [Edited by - Zefrieg on September 22, 2004 10:45:47 PM]

If you haven't already, you may want to take a look at the boost graph library. I like the intent of the library, but it went a bit far for me. Still, it does have some good ideas.

Oh, I'm not trying to create some kind of standardization. This will just be a nice template library that I can use in most situations. I'll probably throw it on the Internet for people to use if they want to. I'm just looking on input on how everything looks so far.

Looks like a lot of work done.

One tip:
you are using lists for A*(which I've read through most carefully than others algs), which leads you to:

" openItr = min_element(openNodes.begin(), openNodes.end(), m_compareFunc); "

which is O(n). Use queues (e.g. binary heaps) to speed up things.

Cheers.
/def

Actually, I have fixed all the problems with my searches, and my A* is super-freaking optimized. I can't make it faster. The ones I have posted there do not work.