Can someone explain me the approach to find it in the directed graph,I google it but unable to find the good resource. Please share the implementation.
Minimum arborescence in a directed graph(Minimum spanning tree in directed graph)
We never talk about minimum spanning tree in a directed graph. But still if you are interested, please check out the links below -
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.