Rewriting graphtraverse using bfsearch/dfsearch

13 次查看（过去 30 天）
Dmitrii
Dmitrii 2022-9-28
回答： Ayush 2023-9-8
Hi, I am having trouble with rewriting graphtraverse (now deprecated) using bfsearch.
In particular, I want to make this line work with R2022b:
[D,P]=graphtraverse(G,n);
Where G is graph and n is node of interest. As I understand, function returns D -- indices of discovered nodes, and P -- indices of predecessor nodes. Ideally, i want to replace this line of code using bfsearch instead of graphtraverse so it returns same outputs.
It looks like bfsearch doesn't return predecessor indices, only discoverd nodes, judging by documentation.
Would you kindly help me to navigate this issue?
  2 个评论
Lara
Lara 2022-12-8
Hey, I am struggling to do the same. Have you found a solution?
Dmitrii
Dmitrii 2022-12-12
Hi Lara,
Unfortunately, no. I have ended up using another solution for my project.

请先登录，再进行评论。

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

回答（1 个）

Ayush
Ayush 2023-9-8
Hi @Dmitrii,
I understand that you want a list of predecessors to search a node which you want using bfssearch.
As mentioned in the following documentation https://www.mathworks.com/help/releases/R2022b/matlab/ref/graph.bfsearch.html#buofmch-1-events you can use the events to get a table of all the data like "edgetonew" using the following command
[T,E] = bfsearch(G,s,"edgetonew")
Once you get the the table "T" and Edge indices "E" you can use those to find the predecessor.
Hope this helps!
Thank you.

类别

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

标签

产品


版本

R2022b

Community Treasure Hunt

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

Start Hunting!

Translated by