All possible branch structures starting from one point

6 次查看（过去 30 天）
Jan GimpelHenning
评论： Jan GimpelHenning 2018-8-6
Hi Guys, I have a problem regarding to find all possible trees in a structure starting from one point. I tried to illustrate it on the image attached.
The very left picture shows the nodes and the possible connections. In the end I would like to get the information of all possible branch structures. Is there a function in MATLAB or can anyone help me?
Thank you very much in advance! Jan

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

回答（1 个）

Guillaume
Guillaume 2018-8-3
There isn't a dedicated function for that but it shouldn't be too difficult to write your own using matlab graph functions, in particular bfsearch or dfsearch:
g = graph([1 2 3 3 5], [2 3 4 5 6]);
plot(g);
T = bfsearch(g, 1, 'edgetonew') %should give you a start to build your structure
  3 个评论
显示 1更早的评论
Guillaume
Guillaume 2018-8-6
First, why do you want to do that. Perhaps, ultimately, you're after something that is easier to obtain.
Secondly, can your graph be biconnected? (i.e have loops) and is there an upper bound to the number of branches?
Jan GimpelHenning
Jan GimpelHenning 2018-8-6
Hi, that's very nice that you come back on this. So actually that's what I want to do. I need possible trees starting from a point due to a connectivity matrix, where the end point can be somewhere in the tree. The graph shouldn't have loops. I would like to set a upper bound, but for the maximum nodes per branch (e.g. 100). And the maximum number of junctions should be limited (in the example there is once junction).
Thank you again very much! Jan

请先登录，再进行评论。

类别

在 Help Center 和 File Exchange 中查找有关 Graph and Network Algorithms 的更多信息

标签

产品


版本

R2018a

Community Treasure Hunt

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

Start Hunting!

Translated by