all simple paths problem

2011 7 23
1 个回答
回答已采纳
4 次查看（30 天）

0 个投票

is there a way or an algorithm in matlab to solve the all simple paths problem?
refer: http://xlinux.nist.gov/dads//HTML/allSimplePaths.html
http://stackoverflow.com/questions/58306/graph-algorithm-to-find-all-connections-between-two-arbitrary-vertices

1 个评论
显示 -1更早的评论 隐藏 -1更早的评论

Walter Roberson
Walter Roberson 2011-7-24
Duplicate is at http://www.mathworks.com/matlabcentral/answers/11285-algorithm-to-return-all-possible-connections-between-two-specific-buses-nodes

请先登录，再进行评论。

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

 采纳的回答

Andrew Newell
Andrew Newell 2011-7-24

0 个投票

The package gaimc implements the breadth-first search mentioned in your NIST link. This might be a starting point for you. The remainder of the algorithm description in the NIST link sounds like reasonably straightforward bookkeeping.

2 个评论
显示 无 隐藏 无

Talaria
Talaria 2011-7-24
what is breadth-first search and what is depth first search? i am not familiar with these terms? thanks!
Andrew Newell
Andrew Newell 2011-7-24
If you click on the link for breadth-first search in the NIST link, you'll know as much as me.

请先登录，再进行评论。

更多回答（0 个）

类别

在 帮助中心 和 File Exchange 中查找有关 Mathematics 的更多信息

标签

Community Treasure Hunt

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

Start Hunting!

Translated by