小编use*_*173的帖子

import java.util.InputMismatchException;

    import java.util.Scanner;

    import java.util.Stack;

public class TSPNearestNeighbour {
 {

        private final Stack<Integer> stack;
        private int numberOfNodes;
        public TSPNearestNeighbour()

        {

            stack = new Stack<Integer>();

        }



        public void tsp(int adjacencyMatrix[][])

        {

            numberOfNodes = adjacencyMatrix[1].length - 1;

            int[] visited = new int[numberOfNodes + 1];

            visited[1] = 1;

            stack.push(1);

            int element, dst = 0, i,cost=0;

            int min = Integer.MAX_VALUE;

            boolean minFlag = false;

            System.out.print(1 + "\t");



            while (!stack.isEmpty())

            {

                element = stack.peek();

                i = 1;

                min = Integer.MAX_VALUE;

                while (i <= numberOfNodes) …