[[courses:cs211:winter2014:journals:alyssa:chapter_4.4]]
Trace:
Show page
Recent ChangesSitemap

Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revisionPrevious revision
courses:cs211:winter2014:journals:alyssa:chapter_4.4 [2014/02/26 02:45] – [Dijkstra's Algorithm] hardnettacourses:cs211:winter2014:journals:alyssa:chapter_4.4 [2014/02/26 02:49] (current) – hardnetta
Line 11: Line 11:
  
 Using a priority queue, Dijkstra's Algorithm can be implemented on a graph with //n// nodes and //m// edges to run in O(m) time, plus the time for //n// **ExtractMin** and //m// **ChangeKey** operations. So the overall running time is O(mlogn). Using a priority queue, Dijkstra's Algorithm can be implemented on a graph with //n// nodes and //m// edges to run in O(m) time, plus the time for //n// **ExtractMin** and //m// **ChangeKey** operations. So the overall running time is O(mlogn).
 +
 +I would rate this section an 8. It was easy to read but the lecture was easier to understand.
courses/cs211/winter2014/journals/alyssa/chapter_4.4.1393382725.txt.gz · Last modified: by hardnetta
Show pageOld revisions
Media ManagerBack to top
CC Attribution-Noncommercial-Share Alike 4.0 International
Driven by DokuWiki Recent changes RSS feed Valid CSS Valid XHTML 1.0