sir,
first we will calculate indegree and outdegree for every node if indegree == outdegree for every node then the graph will be strongly connected graph
is this approach is correct or not
Kosaraju algorithm
@pps.vikhyat.17 Check if your approach works for this case:
Here you can visit all other nodes from any node.
kk i got it
thank you so much
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.