0
$\begingroup$

I am new to this algorithm and graphs. Just started learning. Could someone help me which algorithm is best suited to find the spanning tree of a Directed Acyclic Graph with less forward edges?

$\endgroup$
  • $\begingroup$ Isn't a Directed Acyclic Graph already a spanning tree? $\endgroup$ – Shubham Singh rawat Nov 20 '16 at 3:00
  • 1
    $\begingroup$ @ShubhamSinghrawat : ​ ​ ​ It doesn't need to be. ​ Consider a diamond with all edges directed down. ​ ​ ​ ​ ​ ​ ​ ​ $\endgroup$ – user12859 Nov 20 '16 at 8:42
  • 1
    $\begingroup$ What do you mean by "with less forward arc/edges"? $\endgroup$ – David Richerby Nov 20 '16 at 11:04
  • $\begingroup$ Probably transitive reduction. $\endgroup$ – KWillets Nov 20 '16 at 19:54

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.