location.java

构建网上购书最优联盟 此篇文章重在构建囊括最多变量因素的网上购书联盟。计算最优则变成了不断测试不断更改变量的统计型问题。而联盟要求的最低构建要素是： &#61548 联盟中心到站点的运输费

package tomato;



final class Location {
  
  private int d_longitude;
  private int d_latitude;
  
  public Location(int longitude,int latitude){
    
    d_longitude = longitude;
    d_latitude = latitude;	
  }
  
  public void SetLocation(Location location){
    
    d_longitude = location.d_longitude;
    d_latitude = location.d_latitude;	
  }
  
  
   public void SetLocation(int longitude,int latitude){   
                                                 
     d_longitude = longitude;         
     d_latitude = latitude;	       
   }                                             
  
  
  public int GetLongitude(){
    
    return d_longitude;	
  }
  
  public int GetLatitude(){
    
    return d_latitude;	
  }
  
  public void Display(){
  
    System.out.println("    The location is: ("+this.GetLongitude()+","+this.GetLatitude()+")");
	
  }
  
  public double CalculateDistance(Location rhd){
    
    return Math.sqrt((this.d_longitude-rhd.d_longitude)*(this.d_longitude-rhd.d_longitude)+(this.d_latitude-rhd.d_latitude)*(this.d_latitude-rhd.d_latitude));
  }
  
  public static void main(String[]args){
  	
    Location aTest = new Location(3,4);	
    Location bTest = new Location(0,0);

    aTest.Display(); 
    bTest.Display();
    
    System.out.println(aTest.CalculateDistance(bTest));
    System.out.println(bTest.CalculateDistance(aTest));
        
  	
  }
  
}