The only time another path may exist is in the event that you have a choice of several nodes to traverse in order to get a shortest path (these nodes have the same final path length from the start vertex). In such a case, it is usual to pick any of the nodes and continue applying the algorithm. To find all of the paths, you could either use recursion, or save the state at that step and restart the algorithm at that point later.
--- sejal patel <[EMAIL PROTECTED]> wrote: > I have to find shortest path in graph and also how many > exist in graph > > I can find the shortest path but cant find how many exist > in graph. > > In program graph representaion is adjacency matrix list > and i am using > c++. > > Please help me.... > > > > > _________________ Joseph A. Marrero http://www.l33tprogrammer.com/ ____________________________________________________________________________________ Got a little couch potato? Check out fun summer activities for kids. http://search.yahoo.com/search?fr=oni_on_mail&p=summer+activities+for+kids&cs=bz
