retroactive-priority-queue icon indicating copy to clipboard operation
retroactive-priority-queue copied to clipboard

Published 20 hours ago • verified publisher icon chshersh
→

Metadata

implementation of partially retroactive priority queue (including its visualization) with O(log m) update time and O(log n) query

retroactive-priority-queue

Implementation of partially retroactive priority queue with O(log m) update time and O(log n) query time, where m — number of operations, n — size of queue in current time.

Main idea can be found in «Retroactive Data Structures» by ERIK D. DEMAINE, 2007. (a, b)-tree is replaced by cartesian tree with implicit key.

Implementation also contains visualization.

← Metadata

5
Stars
1
Forks
Watchers

Owner

verified publisher icon chshersh

Metadata

implementation of partially retroactive priority queue (including its visualization) with O(log m) update time and O(log n) query

Back