Use a simple modified version of Floyd-Warshall Algo for shortest path. On Fri, Dec 18, 2009 at 2:16 PM, Linus Probert <linus.prob...@gmail.com>wrote:
> I agree, if memory is not an issue use a breadth first search, but if > memory is an issue it can get quite interesting. > > > sharad kumar wrote: > > if its a digraph make use of topsort or make use of bfs > > > > On Thu, Dec 17, 2009 at 5:19 PM, vicky <mehta...@gmail.com> wrote: > > > > > >> given a graph G(V,E) and a source vertex, v. no. of vetices n, and > >> edges e. you have to find all different paths from vertex v to some > >> vertex N, having exactly i(1<i<n) edges. v,N,i will be given by the > >> user. provide an algorithm for it. > >> > >> -- > >> > >> 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<algogeeks%2bunsubscr...@googlegroups.com> > <algogeeks%2bunsubscr...@googlegroups.com<algogeeks%252bunsubscr...@googlegroups.com> > > > >> . > >> For more options, visit this group at > >> http://groups.google.com/group/algogeeks?hl=en. > >> > >> > >> > >> > > > > -- > > > > 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<algogeeks%2bunsubscr...@googlegroups.com> > . > > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > > > > > > > > > -- > > 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<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > > Please access the attached hyperlink for an important electronic communications disclaimer: http://dce.edu/web/Sections/Standalone/Email_Disclaimer.php -- 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.
