5 #ifndef BPP_PHYL_DISTANCE_BIONJ_H
6 #define BPP_PHYL_DISTANCE_BIONJ_H
36 BioNJ(
bool rooted =
false,
bool positiveLengths =
false,
bool verbose =
true) :
49 BioNJ(
const DistanceMatrix& matrix,
bool rooted =
false,
bool positiveLengths =
false,
bool verbose =
true) :
65 std::string
getName()
const {
return "BioNJ"; }
73 double computeDistancesFromPair(
const std::vector<size_t>& pair,
const std::vector<double>& branchLengths,
size_t pos);
The BioNJ distance method.
double computeDistancesFromPair(const std::vector< size_t > &pair, const std::vector< double > &branchLengths, size_t pos)
Actualizes the distance matrix according to a given pair and the corresponding branch lengths.
BioNJ(bool rooted=false, bool positiveLengths=false, bool verbose=true)
Create a new BioNJ object instance and compute a tree from a distance matrix.
std::string getName() const
BioNJ(const DistanceMatrix &matrix, bool rooted=false, bool positiveLengths=false, bool verbose=true)
Create a new BioNJ object instance and compute a tree from a distance matrix.
void setDistanceMatrix(const DistanceMatrix &matrix)
Set the distance matrix to use.
void computeTree()
Compute the tree corresponding to the distance matrix.
The neighbor joining distance method.
virtual void setDistanceMatrix(const DistanceMatrix &matrix)
Set the distance matrix to use.
virtual void outputPositiveLengths(bool yn)
Defines the basic types of data flow nodes.