[Retracted] Asymptotically Effective Method to Explore Euler Path in a Graph

Algorithm 1

Euler path [11, 12].

	EularPathInConnectedGraph (G: connected undirected graph with exactly two nodes of odd degree)
(1)	Make sure the graph G has 2 odd nodes.
(2)	Start at any one of the two odd nodes.
(3)	Traverse the edges one by one and then add in the array EP.
(4)	While traversing a bridge or a nonbridge edge, select the nonbridge edge.
(5)	Stop when you run out of edges.
	return EP