Proved algorithm to Create Graph With Eulerian Tour?

Question

I wonder if it exists a proved algorithm that given a set of nodes it creates a graph with eulerian tour. I've looked for it in google but i've just found the Fleury's algorithm, which only says if we can find an eulerian tour in a graph. Do you know if such an algorithm exists? Thanks :)

Answer 1

(This is an answer to the comment which adds more details to the question).

The problem "find all possible eulerian tours given a set of nodes" is the same as "find all eulerian tours in a complete undirected graph". This is an open problem with some approximation problems available.

Some details on research here and here