"UNIQUE" STL list member function
Hiya to everyone. I´m implementing an A_star search function and, for applying "Dynamic Development" (the target is to delete redundant paths from the "Awaiting to be explored" path list) I would like to use the "UNIQUE" member function provided by STL for lists. This member deletes all elements of a list (the elements are paths in this case) which carry out with the requeriments of a Binary Predicate.All of them... but one.
The predicate for two each two paths into the list is, of course, having the same first vertex AND the same last vertex for the two paths. It´s carryng out... One path will be deleted ; ) The questions is...which remains?. I need, for an efficent A* algorithm, the shortest to be kept, and the longer to be deleted.
Well. anyone has the idea of how UNIQUE member function works internally?. Do you know which are the choosing techniques for deleting?.If UNIQUE makes just a randomly choosing, it´s not of use to me. so that I would try to perform an own "Dynamic Development" function...
The predicate for two each two paths into the list is, of course, having the same first vertex AND the same last vertex for the two paths. It´s carryng out... One path will be deleted ; ) The questions is...which remains?. I need, for an efficent A* algorithm, the shortest to be kept, and the longer to be deleted.
Well. anyone has the idea of how UNIQUE member function works internally?. Do you know which are the choosing techniques for deleting?.If UNIQUE makes just a randomly choosing, it´s not of use to me. so that I would try to perform an own "Dynamic Development" function...
