Presentations

Boc Can Mckenzie 080910

Description
This is a good ppt
Categories
Published
of 23
All materials on our website are shared by users. If you have any questions about copyright issues, please report us to resolve them. We are always happy to assist you.
Related Documents
Share
Transcript
  DIJKSTRA’S  ALGORITHM Fibonacci Heap Implementation by Amber McKenzie and Laura Boccanfuso  Dijkstra’s  Algorithm Question : How do you know that Dijkstra’s algorithm finds the shortest path and is optimal when implemented with the Fibonacci heap?  Single-Source Shortest Path  For a given vertex, determine the shortest path between that vertex and every other vertex, i.e. minimum spanning tree.  Premise of Dijkstra’s  Algorithm    First, finds the shortest path from the vertex to the nearest vertex.  Then, finds the shortest path to the next nearest vertex, and so on.  These vertices, for which the shortest paths have been found, form a subtree.  Thus, the next nearest vertex must be among the vertices that are adjacent to those in the subtree; these next nearest vertices are called fringe vertices.
Search
Tags
Related Search
We Need Your Support
Thank you for visiting our website and your interest in our free products and services. We are nonprofit website to share and download documents. To the running of this website, we need your help to support us.

Thanks to everyone for your continued support.

No, Thanks