Open arnaudgelas opened 13 years ago
In the current ITK implementation the used priority queue was taken from the STL and could element could not be updated. Instead of inserting/pushing all elements, we need to update the element if it is already in the container, else insert it.
In the current ITK implementation the used priority queue was taken from the STL and could element could not be updated. Instead of inserting/pushing all elements, we need to update the element if it is already in the container, else insert it.