Hamiltonian circuits : Sorted-edges algorithm - Basic question PLS HELP ASAP?

We're doing nearest-neighbor and sorted-edges algorithms in cl, but what I don't understand is the sorted-edges algorithm. Isn't it the same as the nearest neighbor algorithm when started from the smallest edge?