Multiple paths in a graph - Programmers Heaven

Howdy, Stranger!

It looks like you're new here. If you want to get involved, click one of these buttons!

Categories

Multiple paths in a graph

VirajithVirajith Posts: 1Member
Hi,

I would like to know if there is any special algorithm to find, in a graph a certain number of paths (say =MAX_PATHS, the case when the number of paths are less than MAX_PATHS must also be taken care of )from a given source to all the other vertices in the graph.
By special I imply that this algorithm must not be like applying the standard algorithms like DFS, BFS etc multiple times by removing the edges already used.

Thanks,
Virajith
Sign In or Register to comment.