Lecture Priority Queue Quiz Sample Is array a

  • Slides: 44
Download presentation
Lecture: Priority Queue

Lecture: Priority Queue

Quiz Sample • Is array a data structure? • What is a data structure?

Quiz Sample • Is array a data structure? • What is a data structure? No! Why? It is a data organization associated with a set of operations • What data structures are implemented by array? Stack, Queue, List, Heap, Max-heap, Min-heap, … • Priority queue (max --, min --).

Quiz Sample • Is Dial algorithm with running time O(m+nc) a polynomial-time algorithm, where

Quiz Sample • Is Dial algorithm with running time O(m+nc) a polynomial-time algorithm, where c is the maximum arc length?

Quiz Sample • Is Dial algorithm with running time O(m+nc) a polynomial-time algorithm, where

Quiz Sample • Is Dial algorithm with running time O(m+nc) a polynomial-time algorithm, where c is the maximum arc length? • Answer: No

Implementations • With min-priority queue, Dijkstra algorithm can be implemented in time • With

Implementations • With min-priority queue, Dijkstra algorithm can be implemented in time • With Fibonacci heap, Dijkstra algorithm can be implemented in time • With Radix heap, Dijkstra algorithm can be implemented in time

Contents • Recall: Heap, a data structure Min-heap (a) Min-Heapify procedure (b) Building a

Contents • Recall: Heap, a data structure Min-heap (a) Min-Heapify procedure (b) Building a min-heap • Min-Priority Queue • Implementation of Dijkstra’s Algorithm

Heap

Heap

A Data Structure Heap • A heap is an array object that can be

A Data Structure Heap • A heap is an array object that can be viewed as a nearly complete binary tree. 1 6 2 3 5 3 4 2 5 4 6 5 3 2 4 1 6 1 All levels except last level are complete. Tied with three procedures for finding Parent, finding left child, and finding Right child.

Min-Heap

Min-Heap

Min-Heap

Min-Heap

Min-Heapify • Min-Heapify(A, i) is a subroutine. • Input: When it is called, two

Min-Heapify • Min-Heapify(A, i) is a subroutine. • Input: When it is called, two subtrees rooted at Left(i) and Right(i) are minheaps, but A[i] may not satisfy the minheap property. • Output: Min-Heapify(A, i) makes the subtree rooted at A[i] become a min-heap by letting A[i] “float down”.

4 14 4 12 14 7 8 11 12 4 8 2 7 14

4 14 4 12 14 7 8 11 12 4 8 2 7 14 1 7 8 11

Building a Min-Heap e. g. , 4, 1, 3, 2, 16, 9, 10, 14,

Building a Min-Heap e. g. , 4, 1, 3, 2, 16, 9, 10, 14, 8, 7.

4 1 2 14 3 16 8 7 9 10

4 1 2 14 3 16 8 7 9 10

4 1 2 14 3 7 8 16 9 10

4 1 2 14 3 7 8 16 9 10

4 1 2 14 3 7 8 16 9 10

4 1 2 14 3 7 8 16 9 10

4 1 2 14 3 7 8 16 9 10

4 1 2 14 3 7 8 16 9 10

4 1 2 14 3 7 8 16 9 10

4 1 2 14 3 7 8 16 9 10

1 4 2 14 3 7 8 16 9 10

1 4 2 14 3 7 8 16 9 10

1 2 4 14 3 7 8 16 9 10

1 2 4 14 3 7 8 16 9 10

Priority Queue

Priority Queue

Priority Queue • A priority queue is a data structure for maintaining a set

Priority Queue • A priority queue is a data structure for maintaining a set of elements, each with an associated value, called a key. • A min-priority queue supports the following operations: Minimum(S), Extract-Min(S), Increase-Key(S, x, k), Insert(S, x). • Min-Heap can be used for implementing min-priority queue.

Input: 4, 1, 3, 2, 16, 9, 10, 14, 8, 7. Build a min-heap

Input: 4, 1, 3, 2, 16, 9, 10, 14, 8, 7. Build a min-heap 1 2 4 14 3 7 8 9 10 16 1, 2, 3, 4, 7, 9, 10, 14, 8, 16.

16 2 4 14 3 7 9 10 8 16, 2, 3, 4, 7,

16 2 4 14 3 7 9 10 8 16, 2, 3, 4, 7, 9, 10, 14, 8.

2 16 4 14 3 7 9 10 8 2, 16, 3, 4, 7,

2 16 4 14 3 7 9 10 8 2, 16, 3, 4, 7, 9, 10, 14, 8.

2 4 7 16 14 3 9 10 8 2, 4, 3, 16, 7,

2 4 7 16 14 3 9 10 8 2, 4, 3, 16, 7, 9, 10, 14, 8.

2 4 8 14 3 7 9 10 16 2, 4, 3, 8, 7,

2 4 8 14 3 7 9 10 16 2, 4, 3, 8, 7, 9, 10, 14, 16.

Element = address i

Element = address i

1 2 4 14 3 7 8 9 10 16 1, 2, 3, 4,

1 2 4 14 3 7 8 9 10 16 1, 2, 3, 4, 7, 9, 10, 14, 8, 16.

1 2 4 14 3 7 1 9 10 16 1, 2, 3, 4,

1 2 4 14 3 7 1 9 10 16 1, 2, 3, 4, 7, 9, 10, 14, 1, 16.

1 2 1 14 3 7 4 9 10 16 1, 2, 3, 1,

1 2 1 14 3 7 4 9 10 16 1, 2, 3, 1, 7, 9, 10, 14, 4, 16.

1 1 2 14 3 7 4 9 10 16 1, 1, 3, 2,

1 1 2 14 3 7 4 9 10 16 1, 1, 3, 2, 7, 9, 10, 14, 4, 16.

1 3 4 14 6 7 8 9 10 16 1, 3, 6, 4,

1 3 4 14 6 7 8 9 10 16 1, 3, 6, 4, 7, 9, 10, 14, 8, 16.

1 3 4 14 6 9 7 8 16 10 +∞ 1, 3, 6,

1 3 4 14 6 9 7 8 16 10 +∞ 1, 3, 6, 4, 7, 9, 10, 14, 8, 16, +∞.

1 3 4 14 6 9 7 8 16 10 2 1, 3, 6,

1 3 4 14 6 9 7 8 16 10 2 1, 3, 6, 4, 7, 9, 10, 14, 8, 16, 2.

1 2 4 14 6 9 3 8 16 10 7 1, 2, 6,

1 2 4 14 6 9 3 8 16 10 7 1, 2, 6, 4, 3, 9, 10, 14, 8, 16, 7.

Implementation of Dijkstra’s Algorithm

Implementation of Dijkstra’s Algorithm

Dijkstra’s Algorithm

Dijkstra’s Algorithm

Implementations • With min-priority queue, Dijkstra algorithm can be implemented in time • With

Implementations • With min-priority queue, Dijkstra algorithm can be implemented in time • With Fibonacci heap, Dijkstra algorithm can be implemented in time • With Radix heap, Dijkstra algorithm can be implemented in time

JAVA PRIORITY QUEUE SUMMARY OF CLASSES PRIORITY QUEUEJAVA PRIORITY QUEUE SUMMARY OF CLASSES PRIORITY QUEUE
JAVA PRIORITY QUEUE SUMMARY OF CLASSES PRIORITY QUEUEJAVA PRIORITY QUEUE SUMMARY OF CLASSES PRIORITY QUEUE
The Priority Queue ADT A priority queue isThe Priority Queue ADT A priority queue is
Priority Queue Priority Queue Each data element hasPriority Queue Priority Queue Each data element has
JAVA PRIORITY QUEUE SUMMARY OF CLASSES PRIORITY QUEUEJAVA PRIORITY QUEUE SUMMARY OF CLASSES PRIORITY QUEUE
Priority Queue and Heap What is Priority QueuePriority Queue and Heap What is Priority Queue
Queue Implementation Array Linked List Queue Array ImplementationQueue Implementation Array Linked List Queue Array Implementation
Priority Queues Priority Queue ADT l A priorityPriority Queues Priority Queue ADT l A priority
Array Array Apa yang dimaksud dengan Array ArrayArray Array Apa yang dimaksud dengan Array Array
ARRAY apa itu array menciptakan array mengakses arrayARRAY apa itu array menciptakan array mengakses array
Array Array Array Array Fadhil Hidayat Email fadhilhidayatyahooArray Array Array Array Fadhil Hidayat Email fadhilhidayatyahoo
Queue 091008 1 Queue Linear Queue It isQueue 091008 1 Queue Linear Queue It is
Queue ADT Queue ADT Queue is a dataQueue ADT Queue ADT Queue is a data
Queue Adam M B DEFINITION Queue queue isQueue Adam M B DEFINITION Queue queue is
STRUKTUR DATA Pertemuan 6 QUEUE QUEUE Antrean queueSTRUKTUR DATA Pertemuan 6 QUEUE QUEUE Antrean queue
STRUKTUR DATA QUEUE QUEUE Antrian Definisi Queue AntrianSTRUKTUR DATA QUEUE QUEUE Antrian Definisi Queue Antrian
Queue 091008 1 Queue Linear Queue It isQueue 091008 1 Queue Linear Queue It is
QUEUE class type Element Queue value empty QueueQUEUE class type Element Queue value empty Queue
Queues What is a Queue Queue Implementations QueueQueues What is a Queue Queue Implementations Queue
STRUKTUR DATA Pertemuan 6 QUEUE QUEUE Antrean queueSTRUKTUR DATA Pertemuan 6 QUEUE QUEUE Antrean queue
7 Queue ADTs Queue concepts Queue applications A7 Queue ADTs Queue concepts Queue applications A
Algoritma dan Struktur Data Queue Queue Apakah queueAlgoritma dan Struktur Data Queue Queue Apakah queue
Queue 3 Queue Antrian 3 1 Definisi QueueQueue 3 Queue Antrian 3 1 Definisi Queue
Queue Deque and Priority Queue Implementations Chapter 23Queue Deque and Priority Queue Implementations Chapter 23