CS402: Computer Communications and Networks

Watch this video to learn about Dijkstra's algorithm, a fundamental concept in graph theory for finding the shortest path in graphs with non-negative weights. Think about how the algorithm determines the shortest path from a source to all vertices. It does this by updating the distances and by prioritizing the nearest vertex, and then it constructs a minimum path tree. The algorithm finds shortest paths but only when using non-negative weights. If negative weights are used, what are the consequences?