[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],[6.1232339957368E-16,10]);line([0,0],[-10,1.2246467991474E-15]);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';fontfill='blue';text([0,0],'A','belowleft');dot([0,0]);fontfill='red';text([5,0],'15');fontfill='red';text([3.0616169978684E-16,5],'7');fontfill='red';text([-5,6.1232339957368E-16],'13');fontfill='red';text([-9.1848509936051E-16,-5],'14');fontfill='blue';text([10,0],'B','belowright');dot([10,0]);fontfill='red';text([5,5],'6');fontfill='red';text([5,-5],'2');fontfill='blue';text([6.1232339957368E-16,10],'C','aboveright');dot([6.1232339957368E-16,10]);fontfill='red';text([-5,5],'8');fontfill='blue';text([-10,1.2246467991474E-15],'D','aboveleft');dot([-10,1.2246467991474E-15]);fontfill='red';text([-5,-5],'3');fontfill='blue';text([-1.836970198721E-15,-10],'E','belowleft');dot([-1.836970198721E-15,-10]);]

Apply the repeated nearest neighbor algorithm to the graph above. Starting at which vertex or vertices produces the circuit of lowest cost?