Page 1 of 1


Posted: Tue Feb 06, 2007 2:02 pm
by rhsumon
Anyone tell about UCS algorithm with the procedure

Posted: Tue Feb 06, 2007 3:32 pm
by misof

Honestly, I don't have a clue what your UCS means or should do, and neither does Google. The algorithm must have a more proper name (e.g., are the UCS initials of its authors? an acronym of the method used?). If you know that, try googling for the long name.

I doubt someone will be able to help you just from the short description you gave.


Posted: Wed Jun 17, 2009 10:40 am
by alirezanoori
Well, UCS stands for Uniform Cost Search and is a graph search algorithm just like BFS (Breadth First Search) but with keeping cost in mind. So it's just like BFS but with a difference that it does not expand the shallowest node, but it expands the node with the lowest cost.
I don't have any implementation to give you here (but I will in a short time and if I did, I could give you that, if you wanted to).
Hope it helps.


Posted: Wed Jun 17, 2009 7:41 pm
by fingon
Seems like Dijkstra's algorithm to me.