Clever Geek Handbook

A proven algorithm for creating a graph with an Euler tour?

I wonder if there is a proven algorithm out there that defines a set of nodes, it creates a graph with an eulerian tour. I searched for it on google, but I just found Fleury's algorithm that only says if we can find the Euler tour in the graph. Do you know if such an algorithm exists? Thank:)

+3


source to share


1 answer


(This is a response to a comment that adds more detail to the question).

The problem "find all possible Euler tours given by a set of nodes" is the same as "find all Euler tours in a complete undirected graph". This is an open issue with some zoom issues available.



Some research details here and here

+2


source






More articles:


All Articles