I have a question about the strongly connected graphs(graph with cycle) so basically I would like to know what is the finishing time of this graph. and how can I decide whether graph is strongly connected or not based on its finishing time? I have seen some people mentioning reversing the direction of arcs and stuff like that but couldn't understand the concept behind it.

CodePudding user response：

I found this helpful website

link : https://www.geeksforgeeks.org/detect-cycle-in-a-graph/

Hope it will help you!!

CodePudding user response：

Check Out Kosaraju Sharir or Tarjan for strongly connected component detection. Complexitys are asintotically the same O(n m) even though Kosaraju is sligthly slower due to double DFS.