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

Info icon 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)
Image of page 1

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

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
Image of page 2
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).
Image of page 3

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

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
Image of page 4
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.
Image of page 5

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

Image of page 6
This is the end of the preview. Sign up to access the rest of the document.
  • Spring '10
  • sartajsahani
  • Graph Theory, Fibonacci heap, overall complexity, theNode, top-level list

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern