Difficult# Determining if a Graph is Strongly Connected

ALGOR-GWNE1N

A directed graph is strongly connected if every node $u$ in the graph has a path to every other node $v$ in the graph.

Which of the following methods is the most effective way to determine if a directed graph is strongly connected that will always return the correct answer?