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. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
