旅行售货员问题 java_旅行售货员问题-分支界限法

旅行售货员问题分支界限法

package test;

import java.util.ArrayList;

import java.util.Collections;

import java.util.Comparator;

import java.util.List;

/**

* Created by saishangmingzhu on 2018/12/13.

* 旅行售货员问题

*/

public class TravellingSalesmanProblem {

//图

private int[][] pointIndex=new int[][]{

{0,30,6,4},

{30,0,5,10},

{6,5,0,20},

{4,10,20,0}};

public static void main(String[] arg){

new TravellingSalesmanProblem().branchAndBoundMethod();

}

/**

* 分支界限法-优先队列式

* 优先队列式求解时，到达第一个没有子结点的活结点时，即为最优解

*/

public void branchAndBoundMethod() {

List pointList=new ArrayList<>();

pointList.add(new Point(0,"1"));

pointList.add(new Point(1,"2"));

pointList.add(n