All edges have discrete costs. And there are 2 paths from a to d that both cost 5. Does Dijkstras always find the shortest path? Yes Dijkstra’s always gives shortest path when the edge costs are all positive. However, it can fail when there are negative edge costs. Does aRead More →