5 #ifndef BPP_PHYL_TREE_NNISEARCHABLE_H
6 #define BPP_PHYL_TREE_NNISEARCHABLE_H
83 virtual double testNNI(
int nodeId)
const = 0;
91 virtual void doNNI(
int nodeId) = 0;
Interface for Nearest Neighbor Interchanges algorithms.
virtual double getTopologyValue() const =0
Get the current score of this NNISearchable object.
virtual void doNNI(int nodeId)=0
Perform a NNI movement.
virtual const Tree & topology() const =0
Get the tree associated to this NNISearchable object.
virtual NNISearchable * clone() const =0
virtual double testNNI(int nodeId) const =0
Send the score of a NNI movement, without performing it.
Implement this interface to be notified when the topology of a tree has changed during topology searc...
Interface for phylogenetic tree objects.
Defines the basic types of data flow nodes.