本文整理汇总了C++中tree::getInternalNodesNum方法的典型用法代码示例。如果您正苦于以下问题：C++ tree::getInternalNodesNum方法的具体用法？C++ tree::getInternalNodesNum怎么用？C++ tree::getInternalNodesNum使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类tree的用法示例。
在下文中一共展示了tree::getInternalNodesNum方法的1个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的C++代码示例。
示例1: tmp
bbAlg::bbAlg(const tree& et,
vector<stochasticProcess> &spVec,
const sequenceContainer& sc,
const bbAlg::boundMethod boundType,
const string& reportFileName,
const MDOUBLE computeAgainExactTreshold,
const distribution * forceDistr) :
_reportFileName(reportFileName),
BandBReportAllPos1(reportFileName,et.getInternalNodesNum()*spVec[0].alphabetSize()*sc.seqLen()),
_et(et), _spVec(spVec), _sc(sc)
{
cout<<"in bbAlg"<<endl;
_boundMethod = boundType;
_alphabetSize=_spVec[0].alphabetSize();
_seqLen=_sc.seqLen();
if (_spVec.size()>1) {//w codon model + gamma special case
_cpij._V.resize(forceDistr->categories());
for (int i=0; i < _spVec.size(); ++i)
_cpij._V[i].fillPij(_et,_spVec[i]);
_spVec[0].setDistribution(forceDistr);//update the first process with gamma distr
//for all the functions that needs number catregor and categor probabilty
}
else{
cout<<"no codon model"<<endl;
_cpij.fillPij(_et,_spVec[0]);
}
_bbesavp1 = new bbEvaluateSpecificAV(_et,_spVec[0],_sc,_cpij);
_bbNodeOrderAlg1 = new bbNodeOrderAlg(_et,_spVec[0],_sc,_cpij,computeAgainExactTreshold);
cout<<"after bbNodeOrderAlg"<<endl;
_bbfindBestAVDynProg1 = new bbfindBestAVDynProg(&_et,&_spVec[0],_sc,&_cpij);
cout<<"after bbfindBestAVDynProg"<<endl;
sequence tmp(_sc.getAlphabet());
const int startingVal = -2;
tmp.resize(_seqLen,&startingVal);
cout<<"after resize"<<endl;
_internalSequences.resize(_et.getNodesNum(),tmp);
cout<<"after _internalSequences resize"<<endl;
_bestReconstruction.resize(_et.getNodesNum(),tmp);
cout<<"afetr _bestReconstruction resize"<<endl;
}