I think using dfs to find all possible path from source tto destination..and selecting the max path would work..
On 2/22/12, krishna kishore <kknarenkris...@gmail.com> wrote: > Hi Gentle Men, Can any Please let me know How to Find a LONGEST PATH in a > Graph ( directed or Undirected but unweighted ). > INPUT: we have to give the Source vertex and Destination Vertex. > OUTPUT: it should include the LENGTH OF PATH and PATH as well. > Remember the graph should not be weighted. > > Any suggestions are accepted for sure. > And Thanks in Advance. > -- > > *Vignesh* > > -- > 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 > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Sent from my mobile device *Dheeraj Sharma* -- 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 algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
