complexity theory - Proved algorithm to Create Graph With Eulerian Tour? -

i wonder if exists proved algorithm given set of nodes creates graph eulerian tour. i've looked in google i've found fleury's algorithm, says if can find eulerian tour in graph. know if such algorithm exists? :)

(this answer comment adds more details question).

the problem "find possible eulerian tours given set of nodes" same "find eulerian tours in complete undirected graph". open problem approximation problems available.

some details on research here , here