No, that's true only for undirected graphs. A DAG can have more than n-1 edges.
On Nov 29, 10:54 pm, Atamurad Hezretkuliyev <[EMAIL PROTECTED]> wrote: > Just use BFS, its running time is O(V+E). In our case, there's no cycle > in DAG so, E<=V-1 always. > > John wrote: > > Given a DAG and two vertices s and t , give a linear time number of > > paths between s and t in G. > > How does topological sort help in finding the same ? --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
