protoas/Coordinate.java

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