find all possible paths of length K from source node to any other nodes????

I want the the code to find all paths of length K originating from source node to other nodes in the graph , where source node is the node that the path of length K will start in it ,and the other node are all nodes the path will end in it . note no edge appear more than once in path

Answer 1

[Walter Roberson]

Read about the Dijkstra algorithm. It will not be exactly what you need in order to record all the paths, but it will form the mathematical basis for finding those paths.

See also:

http://www.mathworks.co.uk/matlabcentral/answers/12283-all-simple-paths-problem

With the breadth-first approach mentioned above, you could stop after descending K deep.

http://blogs.mathworks.com/steve/2011/11/01/exploring-shortest-paths-part-1/

Steve Lord examined a number of shortest path approaches.

[Aseel H]

thank you very much about those links, but please help me more to write the code in matlap. i want to find the path of length k and the distance of it , where k is an integer, not to find the shortest path.