[Graphs generated by this script: setBorder(60,30,60,30);initPicture(-10,10,-10,10); fontsize=14;fontstyle='none';marker=null;line([0,0],[10,0]);line([0,0],[-1.836970198721E-15,-10]);line([10,0],[6.1232339957368E-16,10]);line([10,0],[-1.836970198721E-15,-10]);line([6.1232339957368E-16,10],[-10,1.2246467991474E-15]);line([-10,1.2246467991474E-15],[-1.836970198721E-15,-10]);fontbackground='white';dot([0,0]);dot([10,0]);dot([6.1232339957368E-16,10]);dot([-10,1.2246467991474E-15]);dot([-1.836970198721E-15,-10]);]

What is the smallest number of edges that would need to be duplicated to eulerize this graph?