Dijkstra’s Algorithm: The Basics

Page 1 <img data-url='document/dijkstras-algorithm-the-basics.html?page=1' data-page='1' class='cut-thumb lazyload' alt='Page 1: Dijkstra’s Algorithm: The Basics' loading='lazy' src='data:image/gif;base64,iVBORw0KGgoAAAANSUhEUgAAAAEAAAABCAYAAAAfFcSJAAAADUlEQVR42mNk+P+/HgAFhAJ/wlseKgAAAABJRU5ErkJggg==' data-src='https://reader040.cupdf.com/reader040/viewer/2022020107/568134a6550346895d9baf65/html5/thumbnails/1.jpg' width='140' height='200' /> Graph Primitives

Design and Analysis of Algorithms I

Page 2 <img data-url='document/dijkstras-algorithm-the-basics.html?page=2' data-page='2' class='cut-thumb lazyload' alt='Page 2: Dijkstra’s Algorithm: The Basics' loading='lazy' src='data:image/gif;base64,iVBORw0KGgoAAAANSUhEUgAAAAEAAAABCAYAAAAfFcSJAAAADUlEQVR42mNk+P+/HgAFhAJ/wlseKgAAAABJRU5ErkJggg==' data-src='https://reader040.cupdf.com/reader040/viewer/2022020107/568134a6550346895d9baf65/html5/thumbnails/2.jpg' width='140' height='200' /> Tim Roughgarden

Single-Source Shortest Paths

Page 3 <img data-url='document/dijkstras-algorithm-the-basics.html?page=3' data-page='3' class='cut-thumb lazyload' alt='Page 3: Dijkstra’s Algorithm: The Basics' loading='lazy' src='data:image/gif;base64,iVBORw0KGgoAAAANSUhEUgAAAAEAAAABCAYAAAAfFcSJAAAADUlEQVR42mNk+P+/HgAFhAJ/wlseKgAAAABJRU5ErkJggg==' data-src='https://reader040.cupdf.com/reader040/viewer/2022020107/568134a6550346895d9baf65/html5/thumbnails/3.jpg' width='140' height='200' /> 0,1,2,3

0,1,4,7

0,1,4,60,1,3,6

One of the following is the list of shortest-path distances for the nodes , respectively. Which is it?

Page 4 <img data-url='document/dijkstras-algorithm-the-basics.html?page=4' data-page='4' class='cut-thumb lazyload' alt='Page 4: Dijkstra’s Algorithm: The Basics' loading='lazy' src='data:image/gif;base64,iVBORw0KGgoAAAANSUhEUgAAAAEAAAABCAYAAAAfFcSJAAAADUlEQVR42mNk+P+/HgAFhAJ/wlseKgAAAABJRU5ErkJggg==' data-src='https://reader040.cupdf.com/reader040/viewer/2022020107/568134a6550346895d9baf65/html5/thumbnails/4.jpg' width='140' height='200' /> Tim Roughgarden

Why Another Shortest-Path Algorithm?

Page 5 <img data-url='document/dijkstras-algorithm-the-basics.html?page=5' data-page='5' class='cut-thumb lazyload' alt='Page 5: Dijkstra’s Algorithm: The Basics' loading='lazy' src='data:image/gif;base64,iVBORw0KGgoAAAANSUhEUgAAAAEAAAABCAYAAAAfFcSJAAAADUlEQVR42mNk+P+/HgAFhAJ/wlseKgAAAABJRU5ErkJggg==' data-src='https://reader040.cupdf.com/reader040/viewer/2022020107/568134a6550346895d9baf65/html5/thumbnails/5.jpg' width='140' height='200' /> Tim Roughgarden

Dijkstra’s Algorithm

Page 6 <img data-url='document/dijkstras-algorithm-the-basics.html?page=6' data-page='6' class='cut-thumb lazyload' alt='Page 6: Dijkstra’s Algorithm: The Basics' loading='lazy' src='data:image/gif;base64,iVBORw0KGgoAAAANSUhEUgAAAAEAAAABCAYAAAAfFcSJAAAADUlEQVR42mNk+P+/HgAFhAJ/wlseKgAAAABJRU5ErkJggg==' data-src='https://reader040.cupdf.com/reader040/viewer/2022020107/568134a6550346895d9baf65/html5/thumbnails/6.jpg' width='140' height='200' /> Tim Roughgarden

Example

Page 7 <img data-url='document/dijkstras-algorithm-the-basics.html?page=7' data-page='7' class='cut-thumb lazyload' alt='Page 7: Dijkstra’s Algorithm: The Basics' loading='lazy' src='data:image/gif;base64,iVBORw0KGgoAAAANSUhEUgAAAAEAAAABCAYAAAAfFcSJAAAADUlEQVR42mNk+P+/HgAFhAJ/wlseKgAAAABJRU5ErkJggg==' data-src='https://reader040.cupdf.com/reader040/viewer/2022020107/568134a6550346895d9baf65/html5/thumbnails/7.jpg' width='140' height='200' /> Tim Roughgarden

Non-Example

Dijkstra’s Algorithm: The Basics

Documents