slides - Computer Science - University of San Francisco

17-52: Improving DijkstraCan we do better than Θ(V 2 )For dense graphs, we can’t do betterTo ensure that the shortest path to all verticesis computed, need to look at all edges in thegraphA dense graph can have Θ(V 2 ) edgesFor sparse graphs, we can do betterWhere should we focus our attention?Finding the unknown vertex with minimum cost!