CS nerds, I need an algorithm to verify that an oriented graph is strongly connected. That is to say, you can get from any vertex to another on the graph.
I am currently considering doing something like a depth first search to check for cycles.
What would you do?