Rewriting graphtraverse using bfsearch/dfsearch

Question

Dmitrii 2022-9-28

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/1814005-rewriting-graphtraverse-using-bfsearch-dfsearch

回答： Ayush 2023-9-8

在 MATLAB Online 中打开

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 2022-12-8

Hey, I am struggling to do the same. Have you found a solution?

Dmitrii 2022-12-12

Hi Lara,

Unfortunately, no. I have ended up using another solution for my project.

请先登录，再进行评论。

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

Answer 1

Ayush 2023-9-8

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/1814005-rewriting-graphtraverse-using-bfsearch-dfsearch#answer_1305216

在 MATLAB Online 中打开

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.