in some cases, in particular when the the edge loops were not planar. Now rather than finding the shortest distance between two vertices, one from each edge loop and using that as a starting point, it now finds the smallest sum of distances between all vertex pairs that would be connected.