http://blog.csdn.net/ecttx/article/details/8372486参考一下这个

我也不会递归啊，不知道这个方法行不行
Dictionary dic = new Dictionary();
double minlen, len;
point p;
foreach(point p1 in plist) {
if(dic.ContainsKey(p1))
continue;
minlen = 0;
foreach(poing p2 in plist) {
len = p1p2的距离
if(minlen == 0) {
minlen = len;
p = p2;
} else if(minlen > len) {
minlen = len;
p = p2;
}
}

    dic.Add(p1, len);
    dic.Add(p, len);

}

网上搜一下：汉密尔顿回路