Discover a wealth of knowledge at Westonci.ca, where experts provide answers to your most pressing questions. Find reliable answers to your questions from a wide community of knowledgeable experts on our user-friendly Q&A platform. Our platform provides a seamless experience for finding reliable answers from a network of experienced professionals.

Which algorithm is commonly used to find the shortest path in a graph where all edges have non-negative weights?
A) Dijkstra's algorithm
B) Prim's algorithm
C) Bellman-Ford algorithm
D) Kruskal's algorithm


Sagot :