Which algorithm is typically used for shortest path routing in networks?

a$)$ Kruskal's Algorithm

b$)$ Bellman$-$Ford Algorithm

c$)$ Dijkstra's Algorithm

d$)$ Prim's Algorithm