教程成果文件.pdfVIP

Heaps Operation Linked List Binary Binomial Fibonacci make-heap 1 1 1 1 insert 1 log N log N 1 minimum N 1 log N 1 extract-min N log N log N log N union 1 N log N 1 decrease-key 1 log N log N 1 delete N log N log N log N Amortized Fibonacci CSC 6580 Heaps - 2 * Queues are a standard mechanism for ordering tasks on a e, first-served basis * However, some tasks may be more important or timely than others (higher priority) * Priority queues * Store tasks using a partial ordering based on priority * Ensure highest priority task at head of queue * Heaps are the underlying data structure of priority queues CSC 6580 3 3 * Main operations * insert (i.e., enqueue) * Dynamic insert * specification of a priority level (0-high, 1,2.. Low) * deleteMin (i.e., dequeue) * Finds the current minimum element (read: “highest priority”) in the queue, deletes it from the queue, and returns it * Performance goal is for operations to be “fast” CSC 6580 4 Can we buil ta structu