Programming, Data Structures, Algorithms, Computer Science, Tech.
start at node a, but we don’t know if there is a path to reach it, or if there are many paths to reach it! In any case, we don’t know which path will be the shortest one to get to node e, if such a path even exists. Dijkstra’s algorithm does require a bit of initial setup. But, before we get to