A DAG naturally has sources - vertices with only out-going edges - and sinks - vertices with only incoming edges. All edges with a maximal number of edges run from a source to a sink (why?). You can find them most easily with a breadth-first search starting simultanously from all the sources.
On Sep 6, 9:34 am, Maria <lydwin.ma...@gmail.com> wrote: > In a DAG, print the maximal paths.... > Can any one help me out with this question...? > I don seem to understand the question itself... -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
