Which algorithm is used to find the strongly connected components in a graph? $-$ A$)$ Dijkstra's Algorithm $-$ B$)$ Floyd$-$Warshall Algorithm $-$ C$)$ Kosaraju's Algorithm $-$ D$)$ Kruskal's Algorithm