![]() ![]() More advanced implementations may support more complicated operations, such as pull_lowest_priority_element, inspecting the first few highest- or lowest-priority elements, clearing the queue, clearing subsets of the queue, performing a batch insert, merging two or more queues into one, incrementing priority of any element, etc. This operation and its O(1) performance is crucial to many applications of priority queues. In addition, peek (in this context often called find-max or find-min), which returns the highest-priority element but does not modify the queue, is very frequently implemented, and nearly always executes in O(1) time. This may instead be specified as separate " peek_at_highest_priority_element" and " delete_element" functions, which can be combined to produce " pull_highest_priority_element". Some conventions reverse the order of priorities, considering lower values to be higher priority, so this may also be known as " get_minimum_element", and is often referred to as " get-min" in the literature. This is also known as " pop_element(Off)", " get_maximum_element" or " get_front(most)_element".
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |