Finding all Eulerian Paths in an undirected graph

Question

Anthony Stuart 2020-8-24

0
链接

此问题的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/583907-finding-all-eulerian-paths-in-an-undirected-graph

回答： Pranav Verma 2020-8-28

I'm trying to write a script that takes an undirected graph G and returns a matrix of all the possible Eulerian paths that go through each edge exactly once (assuming that the graph is either an Eulerian loop or path. I've found some resources for how to do this in C++ by creating a separate graph class, but I was wondering if there is an easy way to do it using the built in tools for undirected graphs in Matlab.

0 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

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

Answer 1

Pranav Verma 2020-8-28

0
链接

此回答的直接链接

https://ww2.mathworks.cn/matlabcentral/answers/583907-finding-all-eulerian-paths-in-an-undirected-graph#answer_486215

Hi Anthony,

You can try utilising the Matgraph toolbox for your problem. A function euler_trail exists in the toolbox which may help you in proceeding with your task. Below is the link to the toolbox:

https://www.mathworks.com/matlabcentral/fileexchange/19218-matgraph

Please go through the above link and add the Matgraph add-on in Matlab.

For undirected graphs in Matlab, please refer to the below documentation where it lists all the functions that are available in Matlab along with some examples:

https://www.mathworks.com/help/matlab/math/directed-and-undirected-graphs.html

For further information on graph algorithms, please refer to the below documentation;

https://www.mathworks.com/help/matlab/graph-and-network-algorithms.html