Well if you have a graph of 'n' nodes ... then the number of paths can be n! . And you would need that much time to enumerate all of them.
You can write a recursive algo to do this job. -Dhyanesh On 5/8/06, david wolf <[EMAIL PROTECTED]> wrote: > > Hi, > > I have a questions about a directed graph. Given two node k and i, I > wish to enumerate all the paths from node k to node i. How to do this? > > Can anyone direct me how to do it or maybe give me a url for > explanation somewhere else? > > Also, what is the time complexity for achieving this? > > Thanks, > > David > > > > > --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
