Welcome to the new platform of Programmers Heaven! We apologize for the inconvenience caused, if you visited us from a broken link of the previous version. The main reason to move to a new platform is to provide more effective and collaborative experience to you all. Please feel free to experience the new platform and use it's exciting features. Contact us for any issue that you need to get clarified. We are more than happy to help you.
Multiple paths in a graph
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.