TSPproblem.java

//Definicija problema trgovskega potnika
 
public class TSPproblem {
  final public int MAX_COST = 100 ;
  public int size ;
  public int cost[][] ;
 
  public TSPproblem() {
    this(0) ;
  }
  public TSPproblem(int sz) {
    size = sz ;
    if (size > 0)
      generate(size) ;
    else  cost = null ;
  }
 
  public void generate(int sz) {
    size = sz ;
    cost = new int[size][size] ;
    int i,j ;
    for (i = 0 ; i < size ; i++) {
      cost[i][i] = 0 ;
      for (j = i + 1; j < size; j++)
        cost[i][j] = cost[j][i] = (int) (MAX_COST * Math.random() + 1.0);
    }
  }
 
  public void printOut() {
    int i, j ;
    System.out.print("   ") ;
    for (i=0 ; i < size ; i++)
      System.out.print(i+"  ") ;
    System.out.println("") ;
    for (i=0 ; i < size ; i++) {
       System.out.print(i+"  ") ;
       for (j=0 ; j < size ; j++)
         System.out.print(cost[i][j]+" ") ;
       System.out.println("") ;
    }
  }
}