package bicat.run_machine;

/**
 * <p>Title: BicAT Tool </p>
 * <p>Copyright: Copyright (c) 2004</p>
 * @author Waseem Ahmad (wahmad at acm.dot.org)
 * @version 1.0
 *
 * Arguments for cHawk. CC-specific arguments are \delta, I (number of iterations of 
 crossing minimization heuristics), and N, the normalization threshold.
 *
 *
 **/

public class ArgumentscHawk extends Arguments {

  double delta;
  int iter;
  int algo;
  
  int randomize;

  double p_rand_1;
  double p_rand_2;
  double p_rand_3;

  int norm_th;

  // ===========================================================================
  public ArgumentscHawk() { }

  // ===========================================================================
  public void setRandomize(int r) { randomize = r; }
  public void setAlgorithm(int alg){algo = alg;}

  public void setDelta(double d) { delta = d; }
  public void setIter(int a) { iter = a; }

  public void setPR1(double pr1) { p_rand_1 = pr1; }
  public void setPR2(double pr2) { p_rand_2 = pr2; }
  public void setPR3(double pr3) { p_rand_3 = pr3; }

  public void setN(int nn) { norm_th = nn; }

  // ===========================================================================
  public int getRandomize() { return randomize; }
  public int getAlgorithm(){return algo;}

  public double getDelta() { return delta; }
  public int getIter() { return iter; }

  public double getPR1() { return p_rand_1; }
  public double getPR2() { return p_rand_2; }
  public double getPR3() { return p_rand_3; }

  public int getN() { return norm_th; }
}