# lec14 - Fibonacci Heaps Insert Actual O(1 Amortized O(1...

This preview shows pages 1–6. Sign up to view the full content.

Fibonacci Heaps Actual Amortized Insert O(1) O(1) Remove min (or max) O(n) O(log n) Meld O(1) O(1) Remove O(n) O(log n) Decrease key (or increase) O(n) O(1)

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Single Source All Destinations Shortest Paths 1 2 3 4 5 6 7 2 6 16 7 8 10 3 14 4 4 5 3 1
Greedy Single Source All Destinations Known as Dijkstra’s algorithm. Let d(i) be the length of a shortest one edge extension of an already generated shortest path, the one edge extension ends at vertex i . The next shortest path is to an as yet unreached vertex for which the d() value is least. After the next shortest path is generated, some d() values are updated (decreased).

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Greedy Single Source All Destinations 1 2 3 4 5 6 7 2 6 16 7 8 10 3 14 4 4 5 3 1 Path Length 1 0 1 3 2 1 3 5 5 1 2 6 1 3 9 5 4 1 3 10 6 1 3 11 6 7
Operations On d() Remove min. Done O(n) times, where n is the number of vertices in the graph. Decrease d() . Done O(e) times, where e is the number of edges in the graph.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 12/07/2010 for the course COT 5536 taught by Professor Sartajsahani during the Spring '10 term at University of Florida.

### Page1 / 22

lec14 - Fibonacci Heaps Insert Actual O(1 Amortized O(1...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online