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

4 次查看（过去 30 天）
Aseel H
Aseel H 2014-3-27
评论： Aseel H 2014-3-27
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

请先登录，再回答此问题。

回答（1 个）

Walter Roberson
Walter Roberson 2014-3-27
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.
  1 个评论
Aseel H
Aseel H 2014-3-27
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.

请先登录，再进行评论。

类别

在 Help Center 和 File Exchange 中查找有关 Networks 的更多信息

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by