Coordinate.java

   1 import java.util.HashMap;
   2
   3 class Coordinate {
   4
   5   protected Graph graph;
   6   protected final HashMap<Integer, CoordinatePair<Integer, Integer>> Coordinates;
   7
   8   Coordinate(Graph graph) {
   9     this.graph = graph;
  10     this.Coordinates = new HashMap<Integer, CoordinatePair<Integer, Integer>>(graph.getNumOfCities());
  11   }
  12
  13   Coordinate(Graph graph, TSPLibReader tsplibreader) {
  14     this.graph = graph;
  15     this.Coordinates = tsplibreader.getCoordinates();
  16     graph.setNumOfCities(Coordinates.size());
  17   }
  18
  19   public int[][] computeDistances() {
  20
  21     int[][] Distance = new int[graph.getNumOfCities()][graph.getNumOfCities()];
  22
  23     for (int k1 : Coordinates.keySet()) {
  24       for (int k2 : Coordinates.keySet()) {
  25         if (k1 == k2)
  26           Distance[k1][k2] = graph.getINFINITY();
  27         else
  28           Distance[k1][k2] = computeDistance(getCoordinates(k1), getCoordinates(k2));
  29       }
  30     }
  31
  32     return Distance;
  33   }
  34
  35   public int computeDistance(CoordinatePair<Integer, Integer> CityOne,
  36       CoordinatePair<Integer, Integer> CityTwo) {
  37     /* pythagoras: a^2 + b^2 = c^2 => c = sqrt( a^2 + b^2 ) */
  38     return (int)Math.sqrt(
  39         Math.pow((double)(CityOne.getFirst() - CityTwo.getFirst()), 2) +
  40         Math.pow( (double)(CityOne.getSecond() - CityTwo.getSecond()), 2 ) );
  41
  42     /* ATT */
  43     /*
  44     double xd = (double)(CityOne.getFirst() - CityTwo.getFirst());
  45     double yd = (double)(CityOne.getSecond() - CityTwo.getSecond());
  46     double rij = Math.sqrt( (xd*xd + yd*yd) / 10.0 );
  47     return (int)Math.round(rij);
  48     */
  49   }
  50
  51   public CoordinatePair<Integer, Integer> getCoordinates(int City) {
  52     return Coordinates.get(City);
  53   }
  54
  55 }