KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
I need to check if a directed graph is strongly connected , or, in other words, if all nodes can be reached by any other node (not necessarily through direct edge). One way of doing this is running a DFS and BFS on every node and see all others are still reachable. Is there a better approach to do that?
Tags (comma-separated)
Save Edits
Cancel