alvarado: @ADD: The new data structure lti::priorityQueue is simpler alternative to the std::priority_queue, with the main difference that an identifier for the internal elements is kept valid as soon as the elements exists, no matter of changes in its position within the queue. This allows for example the efficient implementation of algorithms to merge graph nodes that changes the edges values dynamically.