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

Algorithm 2

Our proposed algorithm for Euler path.

	EularPathRevised (G: 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 from the Degree column of new adjacency list.
	(a) Follow the edges to even-degree neighboring node of node .
	(b) Add the visited edge in the list EP and remove it from Graph G.
(3)	If there is no choice then
	select the other odd-degree node
(4)	else repeat step a and b.
(5)	Stop when you run out of edges.
	return EP