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.

Answer 1

[Pranav Verma]

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