Which algorithm is used to find the shortest path in a graph?

گراف میں مختصر ترین راستہ تلاش کرنے کے لیے کون سا الگورتھم استعمال ہوتا ہے؟

Decision Tree

Dijkstra's Algorithm

K-Nearest Neighbors

None of these

Dijkstra's Algorithm is used to find the shortest path between nodes in a graph, especially for weighted graphs.

It works by iteratively selecting the closest unvisited node and updating the shortest path estimates.