Examples of com.nr.min.Dynpro

com.nr.min.Dynpro
Given the vector nstate whose integer values are the number of states in each stage (1 for the first and last stages), and given a function cost(j,k,i) that returns the cost of moving between state j of stage i and state k of stage i+1, this routine returns a vector of the same length as nstate containing the state numbers of the lowest cost path. States number from 0, and the first and last components of the returned vector will thus always be 0. Copyright (C) Numerical Recipes Software 1986-2007 Java translation Copyright (C) Huang Wen Hui 2012 @author hwh

//        System.out.printf(nstate[j] << " ";
      }
//      System.out.printf(endl;


      pen.fillmatrix();
      Dynpro dynpro = new Dynpro(){
        public  double cost(int j, int k, int i){
          return pen.c[j][k][i];
        }
      };
      v=dynpro.dynpro(nstate);
      test0=cost(v[0],v[1],0)+cost(v[1],v[2],1)+cost(v[2],v[3],2)
        +cost(v[3],v[4],3)+cost(v[4],v[5],4);


//      for (j=0;j<NSTAGE;j++)
//        System.out.printf(v[j] << " ";

View Full Code Here

TOP

Related Classes of com.nr.min.Dynpro

com.nr.test.test_chapter10.Test_dynpro

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.