Recall that a directed graph is strongly connected if
Chapter , Problem 8.27(choose chapter or problem)
Recall that a directed graph is strongly connected if every two nodes are connected by a directed path in each direction. LetSTRONGLY-CONNECTED = {hGi| G is a strongly connected graph}.Show that STRONGLY-CONNECTED is NL-complete.
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer