Extensions of Dijkstra's Algorithm

Abstract:

For finding shortest paths in simple graphs with weighted edges, there is the well-known Dijkstra's Algorithm which will give the shortest path between a specified vertex and all other vertices. In this talk, I will explain Dijkstra's Algorithm, then present extensions of the algorithm to various specific types of graphs that will be explored, such as graphs with vertex weights, and graphs where the weight function is time-dependent.