The algorithm you have suggested will indeed find the shortest path in this graph, but not all graphs in general. For example, consider this graph: Let’s trace through the execution of your algorithm. First, you set d(A) to 0 and the other distances to ∞. You then expand out node A, setting d(B) to 1, … Read more
Recall that in Dijkstra’s algorithm, once a vertex is marked as “closed” (and out of the open set) – the algorithm found the shortest path to it, and will never have to develop this node again – it assumes the path developed to this path is the shortest. But with negative weights – it might … Read more
I won’t go through each error exhaustively, but here is a general strategy for resolving these errors. When dealing with error messages from the compiler, it is generally a good practice to start with the first error, deal with it, and then attempt to compile again. Oftentimes, a single issue will result in multiple error … Read more