I have a directed graph that I want to find a spanning tree. I read here that Steiner tree will not work on directed graph.
If it’s hard to approximate what would be another algorithm that will work on directed, unweighted graph?
Doing some literature research but they seem to give undirected graph as usage case.
I saw this link in the other stack post but seems weird that they put it behind paywall and not sure how well it’s vetted.
New contributor
Wombat is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.