Finding all Eulerian Paths in an undirected graph
显示 更早的评论
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.
采纳的回答
Pranav Verma
2020-8-28
0 个投票
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:
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:
For further information on graph algorithms, please refer to the below documentation;
更多回答（0 个）
类别
在 帮助中心 和 File Exchange 中查找有关 Undirected Graphs 的更多信息
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Translated by 
