slides - Computer Science - University of San Francisco

More documents

Recommendations

Info

17-6: Single Source Shortest PathIf all edges have unit weight,We can use Breadth First Search to compute theshortest pathBFS Spanning Tree contains shortest path to eachnode in the graphNeed to do some more work to create & saveBFS spanning treeWhen edges have differing weights, this obviouslywill not work
17-7: Single Source Shortest PathDivide the vertices into two sets:Vertices whose shortest path from the initialvertex is knownVertices whose shortest path from the initialvertex is not knownInitially, only the initial vertex is knownMove vertices one at a time from the unknown setto the known set, until all vertices are known
Page 3 and 4: 17-1: Shortest Path ExampleShortest
Page 5: 17-3: Single Source Shortest PathTo
Page 10 and 11: 17-8: Single Source Shortest Path2A
Page 12 and 13: 17-10: Single Source Shortest PathN
Page 14 and 15: 17-12: Single Source Shortest PathA
Page 16 and 17: 17-14: Single Source Shortest PathA
Page 18 and 19: 17-16: Single Source Shortest Path2
Page 24 and 25: 17-22: Dijkstra’s Algorithm Examp
Page 32 and 33: 17-30: Dijkstra’s AlgorithmAfter
Page 42 and 43: 17-40: Dijkstra Codevoid Dijkstra(E
Page 44 and 45: 17-42: Dijkstra Running TimeTime fo
Page 46 and 47: 17-44: Dijkstra Running TimeTotal t
Page 48 and 49: 17-46: Dijkstra Running TimeTotal #
Page 50 and 51: 17-48: Dijkstra Running TimeTotal r
Page 52 and 53: 17-50: Dijkstra Running TimeTotal r
Page 54 and 55: 17-52: Improving DijkstraCan we do
Page 56 and 57: 17-54: Improving DijkstraTo improve
Page 58 and 59:
17-56: Rearranging the heapTotal ti
Page 60 and 61:
17-58: Improving DijkstraCreate a n
Page 62 and 63:
17-60: Improved? Dijkstra TimeDon
Page 64 and 65:
17-62: All-Source Shortest PathWhat
Page 66 and 67:
17-64: All-Source Shortest PathWhat
Page 68 and 69:
17-66: Floyd’s AlgorithmVertices
Page 70 and 71:
17-68: k-path Examples0115 357211Sh
Page 72 and 73:
17-70: Floyd’s AlgorithmShortest
Page 74 and 75:
17-72: Floyd’s AlgorithmIf we had
Page 76 and 77:
17-74: Floyd’s AlgorithmUse a dou
Page 78:
17-76: Floyd’s AlgorithmWe’ve o
show all

slides - Computer Science - University of San Francisco

Create successful ePaper yourself

Delete template?

Save as template?