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

A$)$ Depth$-$First Search $($DFS$)$

B$)$ Breadth$-$First Search $($BFS$)$

C$)$ Dijkstra's Algorithm

D$)$ Kruskal's Algorithm