ashleemw7441 ashleemw7441 14-07-2024 Computers and Technology Answered Which algorithm is commonly used to find the shortest path in a graph where all edges have non-negative weights?A) Dijkstra's algorithmB) Prim's algorithmC) Bellman-Ford algorithmD) Kruskal's algorithm