bpp-core3  3.0.0
bpp::ComputationTree Class Referenceabstract

Defines a Computation Tree based on Operators. More...

#include <Bpp/Numeric/Function/Operators/ComputationTree.h>

+ Inheritance diagram for bpp::ComputationTree:
+ Collaboration diagram for bpp::ComputationTree:

Public Types

typedef AssociationGraphObserver< N, E >::NodeIndex NodeIndex
 
typedef AssociationGraphObserver< N, E >::EdgeIndex EdgeIndex
 
typedef Graph::NodeId NodeGraphid
 
typedef Graph::EdgeId EdgeGraphid
 
typedef AssociationGraphObserver< N, E >::NodeIterator NodeIterator
 
typedef AssociationGraphObserver< N, E >::EdgeIterator EdgeIterator
 
using Eref = std::shared_ptr< E >
 
using Nref = std::shared_ptr< N >
 

Public Member Functions

 ComputationTree (const std::string &formula, const std::map< std::string, std::shared_ptr< FunctionInterface >> &functionNames)
 
ComputationTreeclone () const
 
double getValue () const
 
double getFirstOrderDerivative (const std::string &variable) const
 
double getSecondOrderDerivative (const std::string &variable) const
 
void readFormula (const std::string &formula, const std::map< std::string, std::shared_ptr< FunctionInterface >> &functionNames)
 
std::string output () const
 
bool isAllSum ()
 
bool isValid () const
 
std::shared_ptr< E > getEdgeToFather (const std::shared_ptr< N > nodeObject) const
 
std::shared_ptr< E > getEdgeToFather (const NodeIndex index) const
 
void rootAt (const std::shared_ptr< N > root)
 Sets the root and make the tree directed from root to leaves. More...
 
bool isRooted () const
 
std::shared_ptr< N > getFatherOfNode (const std::shared_ptr< N > nodeObject) const
 
bool hasFather (const std::shared_ptr< N > nodeObject) const
 
bool hasFather (const NodeIndex index) const
 
std::vector< std::shared_ptr< N > > getSons (const std::shared_ptr< N > node) const
 
std::vector< NodeIndexgetSons (const NodeIndex node) const
 
std::vector< std::shared_ptr< E > > getBranches (const std::shared_ptr< N > node) const
 
std::vector< EdgeIndexgetBranches (const NodeIndex node) const
 
std::shared_ptr< N > getSon (const std::shared_ptr< E > edge) const
 
NodeIndex getSon (const EdgeIndex edge) const
 
std::shared_ptr< N > getFatherOfEdge (const std::shared_ptr< E > edge) const
 
NodeIndex getFatherOfEdge (const EdgeIndex edge) const
 
size_t getNumberOfSons (const std::shared_ptr< N > node) const
 
std::vector< std::shared_ptr< N > > getLeavesUnderNode (std::shared_ptr< N > node) const
 
std::vector< NodeIndexgetLeavesUnderNode (NodeIndex node) const
 
std::vector< std::shared_ptr< N > > removeSons (const std::shared_ptr< N > node)
 
void removeSon (const std::shared_ptr< N > node, const std::shared_ptr< N > son)
 
void setFather (const std::shared_ptr< N > nodeObject, const std::shared_ptr< N > fatherNodeObject, const std::shared_ptr< E > edgeObject=0)
 
void addSon (const std::shared_ptr< N > nodeObject, const std::shared_ptr< N > sonNodeObject, const std::shared_ptr< E > edgeObject=0)
 
std::unique_ptr< typename AssociationTreeGraphObserver< N, E >::NodeIteratorsonsIterator (std::shared_ptr< N > node)
 
std::unique_ptr< typename AssociationTreeGraphObserver< N, E >::NodeIteratorsonsIterator (std::shared_ptr< N > node) const
 
std::unique_ptr< typename AssociationTreeGraphObserver< N, E >::EdgeIteratorbranchesIterator (std::shared_ptr< N > node)
 
std::unique_ptr< typename AssociationTreeGraphObserver< N, E >::EdgeIteratorbranchesIterator (std::shared_ptr< N > node) const
 
std::vector< std::shared_ptr< N > > getNodePathBetweenTwoNodes (const std::shared_ptr< N > nodeA, const std::shared_ptr< N > nodeB, bool includeAncestor=true) const
 Get a vector of ancestor nodes between to nodes. More...
 
std::vector< NodeIndexgetNodePathBetweenTwoNodes (const NodeIndex nodeA, const NodeIndex nodeB, bool includeAncestor=true) const
 
std::vector< std::shared_ptr< E > > getEdgePathBetweenTwoNodes (const std::shared_ptr< N > nodeA, const std::shared_ptr< N > nodeB) const
 
std::vector< EdgeIndexgetEdgePathBetweenTwoNodes (const NodeIndex nodeA, const NodeIndex nodeB, bool includeAncestor=true) const
 
std::vector< std::shared_ptr< N > > getSubtreeNodes (const std::shared_ptr< N > localRoot) const
 
std::vector< NodeIndexgetSubtreeNodes (const NodeIndex localRoot) const
 
std::vector< std::shared_ptr< E > > getSubtreeEdges (const std::shared_ptr< N > localRoot) const
 
std::vector< EdgeIndexgetSubtreeEdges (const NodeIndex localRoot) const
 
std::shared_ptr< N > MRCA (const std::vector< std::shared_ptr< N >> vNodeObject) const
 
Graph Relations Management

Modificating the structure of the graph.

virtual void createNode (std::shared_ptr< N > newNodeObject)=0
 
virtual void createNode (std::shared_ptr< N > objectOriginNode, std::shared_ptr< N > newNodeObject, std::shared_ptr< E > newEdgeObject=00)=0
 
virtual void link (std::shared_ptr< N > nodeObjectA, std::shared_ptr< N > nodeObjectB, std::shared_ptr< E > edgeObject=00)=0
 
virtual void unlink (std::shared_ptr< N > nodeObjectA, std::shared_ptr< N > nodeObjectB)=0
 
virtual void deleteNode (std::shared_ptr< N > nodeObject)=0
 
Graph Relations Management

Modificating the structure of the graph.

void createNode (Nref nodeObject)
 
void createNode (Nref objectOriginNode, Nref newNodeObject, Eref newEdgeObject=00)
 
void link (Nref nodeObjectA, Nref nodeObjectB, Eref edgeObject=00)
 
void unlink (Nref nodeObjectA, Nref nodeObjectB)
 
void deleteNode (Nref nodeObject)
 
Object Association

Associate or dissociate N and E objects to pre-existing Graph Nodes and Graph Edges

virtual void associateNode (std::shared_ptr< N > nodeObject, NodeGraphid node)=0
 
virtual void associateEdge (std::shared_ptr< E > edgeObject, EdgeGraphid edge)=0
 
virtual void dissociateNode (std::shared_ptr< N > nodeObject)=0
 
virtual void dissociateEdge (std::shared_ptr< E > edgeObject)=0
 
virtual NodeGraphid getNodeGraphid (const std::shared_ptr< N > nodeObject) const =0
 
virtual EdgeGraphid getEdgeGraphid (const std::shared_ptr< E > edgeObject) const =0
 
virtual const std::shared_ptr< N > getNodeFromGraphid (NodeGraphid) const =0
 
virtual std::shared_ptr< N > getNodeFromGraphid (NodeGraphid)=0
 
virtual std::vector< std::shared_ptr< N > > getNodesFromGraphid (std::vector< NodeGraphid >) const =0
 
virtual std::shared_ptr< E > getEdgeFromGraphid (EdgeGraphid)=0
 
virtual const std::shared_ptr< E > getEdgeFromGraphid (EdgeGraphid) const =0
 
virtual std::vector< std::shared_ptr< E > > getEdgesFromGraphid (std::vector< EdgeGraphid >) const =0
 
virtual std::shared_ptr< N > getRoot () const =0
 
virtual NodeIndex getRootIndex () const =0
 
Object Association

Associate or dissociate N and E objects to pre-existing Graph Nodes and Graph Edges

void associateNode (Nref nodeObject, NodeGraphid graphNode)
 
void associateEdge (Eref edgeObject, EdgeGraphid graphEdge)
 
void dissociateNode (Nref nodeObject)
 
void dissociateEdge (Eref edgeObject)
 
NodeGraphid getNodeGraphid (const Nref nodeObject) const
 
EdgeGraphid getEdgeGraphid (const Eref edgeObject) const
 
Nref getNodeFromGraphid (NodeGraphid node)
 
const Nref getNodeFromGraphid (NodeGraphid node) const
 
std::vector< NrefgetNodesFromGraphid (std::vector< NodeGraphid > nodes) const
 
Eref getEdgeFromGraphid (EdgeGraphid edge)
 
const Eref getEdgeFromGraphid (EdgeGraphid edge) const
 
std::vector< ErefgetEdgesFromGraphid (std::vector< EdgeGraphid > edges) const
 
Nref getRoot () const
 
NodeIndex getRootIndex () const
 
void setRoot (const Nref newRoot)
 set the root (but no checking, to be used at first construction) More...
 
Object Indexation

Get or set indexes to nodes and edges

virtual bool hasNodeIndex (const std::shared_ptr< N > nodeObject) const =0
 return if the object has an index. More...
 
virtual bool hasEdgeIndex (const std::shared_ptr< E > edgeObject) const =0
 
virtual NodeIndex getNodeIndex (const std::shared_ptr< N > nodeObject) const =0
 
virtual std::vector< NodeIndexgetNodeIndexes (std::vector< std::shared_ptr< N >> nodeObjects) const =0
 
virtual EdgeIndex getEdgeIndex (const std::shared_ptr< E > edgeObject) const =0
 
virtual std::vector< EdgeIndexgetEdgeIndexes (std::vector< std::shared_ptr< E >> edgeObjects) const =0
 
virtual NodeIndex setNodeIndex (const std::shared_ptr< N > nodeObject, NodeIndex index)=0
 
virtual EdgeIndex setEdgeIndex (const std::shared_ptr< E > edgeObject, EdgeIndex index)=0
 
virtual bool hasNode (NodeIndex nodeIndex) const =0
 
virtual bool hasEdge (EdgeIndex edgeIndex) const =0
 
virtual std::shared_ptr< N > getNode (NodeIndex nodeIndex) const =0
 
virtual std::shared_ptr< E > getEdge (EdgeIndex edgeIndex) const =0
 
Object Indexation

Get or set indexes to nodes and edges

bool hasNodeIndex (const Nref nodeObject) const
 return if the object has an index. More...
 
bool hasEdgeIndex (const Eref edgeObject) const
 
NodeIndex getNodeIndex (const Nref nodeObject) const
 
std::vector< NodeIndexgetNodeIndexes (std::vector< Nref > nodes) const
 
EdgeIndex getEdgeIndex (const Eref edgeObject) const
 
std::vector< EdgeIndexgetEdgeIndexes (std::vector< Eref > edges) const
 
NodeIndex setNodeIndex (const Nref nodeObject, NodeIndex index)
 
EdgeIndex setEdgeIndex (const Eref edgeObject, EdgeIndex index)
 
bool hasNode (NodeIndex node) const
 
bool hasEdge (EdgeIndex edge) const
 
Nref getNode (NodeIndex node) const
 
Eref getEdge (EdgeIndex edge) const
 
NodeIndex addNodeIndex (const Nref nodeObject)
 
EdgeIndex addEdgeIndex (const Eref edgeObject)
 
bool hasNode (Nref nodeObject) const
 
bool hasEdge (Eref edgeObject) const
 
const std::shared_ptr< TreeGraphImplgetGraph () const
 
std::shared_ptr< TreeGraphImplgetGraph ()
 
std::string nodeToString (const Nref nodeObject) const
 
std::string edgeToString (const Eref edgeObject) const
 
Iterator interface on Nodes
virtual std::unique_ptr< NodeIteratorallNodesIterator ()=0
 
virtual std::unique_ptr< NodeIteratorallNodesIterator () const =0
 
virtual std::unique_ptr< NodeIteratoroutgoingNeighborNodesIterator (std::shared_ptr< N > node)=0
 
virtual std::unique_ptr< NodeIteratoroutgoingNeighborNodesIterator (std::shared_ptr< N > node) const =0
 
virtual std::unique_ptr< NodeIteratorincomingNeighborNodesIterator (std::shared_ptr< N > node)=0
 
virtual std::unique_ptr< NodeIteratorincomingNeighborNodesIterator (std::shared_ptr< N > node) const =0
 
virtual std::vector< std::shared_ptr< N > > getNeighbors (const std::shared_ptr< N > node) const =0
 
virtual std::vector< NodeIndexgetNeighbors (NodeIndex node) const =0
 
virtual std::vector< std::shared_ptr< E > > getEdges (const std::shared_ptr< N > node) const =0
 
virtual std::vector< EdgeIndexgetEdges (NodeIndex node) const =0
 
virtual std::vector< std::shared_ptr< N > > getOutgoingNeighbors (const std::shared_ptr< N > node) const =0
 
virtual std::vector< NodeIndexgetOutgoingNeighbors (NodeIndex node) const =0
 
virtual std::vector< std::shared_ptr< E > > getOutgoingEdges (const std::shared_ptr< N > node) const =0
 
virtual std::vector< EdgeIndexgetOutgoingEdges (NodeIndex node) const =0
 
virtual std::vector< std::shared_ptr< N > > getIncomingNeighbors (const std::shared_ptr< N > node) const =0
 
virtual std::vector< NodeIndexgetIncomingNeighbors (NodeIndex node) const =0
 
virtual std::vector< std::shared_ptr< E > > getIncomingEdges (const std::shared_ptr< N > node) const =0
 
virtual std::vector< EdgeIndexgetIncomingEdges (NodeIndex node) const =0
 
virtual std::vector< std::shared_ptr< N > > getLeavesFromNode (std::shared_ptr< N > node, unsigned int maxDepth) const =0
 
virtual std::vector< std::shared_ptr< N > > getAllLeaves () const =0
 
virtual std::vector< NodeIndexgetAllLeavesIndexes () const =0
 
virtual std::vector< std::shared_ptr< N > > getAllInnerNodes () const =0
 
virtual std::vector< NodeIndexgetAllInnerNodesIndexes () const =0
 
virtual std::vector< std::shared_ptr< N > > getAllNodes () const =0
 
virtual std::vector< NodeIndexgetAllNodesIndexes () const =0
 
Iterators on Nodes
std::unique_ptr< typename AssociationGraphObserver< N, E >::NodeIteratorallNodesIterator ()
 
std::unique_ptr< typename AssociationGraphObserver< N, E >::NodeIteratorallNodesIterator () const
 
std::unique_ptr< typename AssociationGraphObserver< N, E >::NodeIteratoroutgoingNeighborNodesIterator (Nref node)
 
std::unique_ptr< typename AssociationGraphObserver< N, E >::NodeIteratoroutgoingNeighborNodesIterator (Nref node) const
 
std::unique_ptr< typename AssociationGraphObserver< N, E >::NodeIteratorincomingNeighborNodesIterator (Nref node)
 
std::unique_ptr< typename AssociationGraphObserver< N, E >::NodeIteratorincomingNeighborNodesIterator (Nref node) const
 
std::vector< NrefgetNeighbors (const Nref node) const
 
std::vector< NodeIndexgetNeighbors (NodeIndex node) const
 
std::vector< ErefgetEdges (const Nref node) const
 
std::vector< EdgeIndexgetEdges (NodeIndex node) const
 
std::vector< NrefgetOutgoingNeighbors (const Nref node) const
 
std::vector< NodeIndexgetOutgoingNeighbors (NodeIndex node) const
 
std::vector< ErefgetOutgoingEdges (const Nref node) const
 
std::vector< EdgeIndexgetOutgoingEdges (NodeIndex node) const
 
std::vector< NrefgetIncomingNeighbors (const Nref node) const
 
std::vector< NodeIndexgetIncomingNeighbors (NodeIndex node) const
 
std::vector< ErefgetIncomingEdges (const Nref node) const
 
std::vector< EdgeIndexgetIncomingEdges (NodeIndex node) const
 
std::vector< NrefgetLeavesFromNode (Nref node, unsigned int maxDepth) const
 
std::vector< NrefgetAllLeaves () const
 
std::vector< NodeIndexgetAllLeavesIndexes () const
 
std::vector< NrefgetAllInnerNodes () const
 
std::vector< NodeIndexgetAllInnerNodesIndexes () const
 
std::vector< NrefgetAllNodes () const
 
std::vector< NodeIndexgetAllNodesIndexes () const
 
std::unique_ptr< typename AssociationGraphObserver< N, E >::EdgeIteratorallEdgesIterator ()
 
std::unique_ptr< typename AssociationGraphObserver< N, E >::EdgeIteratorallEdgesIterator () const
 
std::unique_ptr< typename AssociationGraphObserver< N, E >::EdgeIteratoroutgoingEdgesIterator (Nref node)
 
std::unique_ptr< typename AssociationGraphObserver< N, E >::EdgeIteratoroutgoingEdgesIterator (Nref node) const
 
std::unique_ptr< typename AssociationGraphObserver< N, E >::EdgeIteratorincomingEdgesIterator (Nref node)
 
std::unique_ptr< typename AssociationGraphObserver< N, E >::EdgeIteratorincomingEdgesIterator (Nref node) const
 
std::vector< ErefgetAllEdges () const
 
std::vector< EdgeIndexgetAllEdgesIndexes () const
 
Eref getEdgeLinking (Nref nodeA, Nref nodeB) const
 
void setEdgeLinking (Nref nodeA, Nref nodeB, Eref edge)
 
bool isLeaf (const Nref node) const
 Is the node a leaf? More...
 
bool isLeaf (const NodeIndex nodeid) const
 
std::pair< Nref, NrefgetNodes (Eref edge) const
 
Iterator interface on Edges
virtual std::unique_ptr< EdgeIteratorallEdgesIterator ()=0
 
virtual std::unique_ptr< EdgeIteratoroutgoingEdgesIterator (std::shared_ptr< N > node)=0
 
virtual std::unique_ptr< EdgeIteratorincomingEdgesIterator (std::shared_ptr< N > node)=0
 
virtual std::vector< std::shared_ptr< E > > getAllEdges () const =0
 
virtual std::vector< EdgeIndexgetAllEdgesIndexes () const =0
 
virtual std::shared_ptr< E > getEdgeLinking (std::shared_ptr< N > nodeA, std::shared_ptr< N > nodeB) const =0
 
virtual void setEdgeLinking (std::shared_ptr< N > nodeA, std::shared_ptr< N > nodeB, std::shared_ptr< E > edge)=0
 
Function called by the subjectGraph

Methods called by the subject graph to make this observer so fit the subject graph

virtual void deletedEdgesUpdate (const std::vector< unsigned int > &edgesToDelete)=0
 
virtual void deletedNodesUpdate (const std::vector< unsigned int > &nodesToDelete)=0
 
Function called by the subjectGraph

These methodes are called by the subject graph to make this observer so fit the subject graph

void deletedEdgesUpdate (const std::vector< unsigned int > &edgesToDelete)
 
void deletedNodesUpdate (const std::vector< unsigned int > &nodesToDelete)
 
Topology exploration

These methodes of the graph concern the topology exploration.

void outputToDot (const std::string &fname, const std::string &name) const
 
void outputToDot (std::ostream &out, const std::string &name) const
 
General Info

General information about the graph

size_t getNumberOfNodes () const
 
size_t getNumberOfEdges () const
 
size_t getNumberOfLeaves () const
 
size_t getDegree (const Nref node) const
 

Static Public Member Functions

template<class A , class B >
static B * copy (const A &a, typename std::enable_if< !std::is_base_of< B, A >::value &&!std::is_abstract< B >::value, B *>::type *=0)
 
template<class A , class B >
static B * copy (const A &a, typename std::enable_if< !std::is_base_of< B, A >::value &&std::is_abstract< B >::value, B *>::type *=0)
 
template<class A , class B >
static B * copy (const A &a, typename std::enable_if< std::is_base_of< B, A >::value &&!std::is_abstract< A >::value, B *>::type *=0)
 
template<class A , class B >
static B * copy (const A &a, typename std::enable_if< std::is_base_of< B, A >::value &&std::is_abstract< A >::value &&std::is_base_of< Clonable, A >::value, B *>::type *=0)
 
template<class A , class B >
static B * copy (const A &a, typename std::enable_if< std::is_base_of< B, A >::value &&std::is_abstract< A >::value &&!std::is_base_of< Clonable, A >::value, B *>::type *=0)
 

Protected Attributes

std::shared_ptr< TreeGraphImplsubjectGraph_
 

Private Member Functions

std::shared_ptr< OperatorreadFormula_ (const std::string &formula, const std::map< std::string, std::shared_ptr< FunctionInterface >> &functionNames)
 

Detailed Description

Defines a Computation Tree based on Operators.

Definition at line 21 of file ComputationTree.h.

Member Typedef Documentation

◆ EdgeGraphid

template<class N, class E, class TreeGraphImpl>
typedef Graph::EdgeId bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::EdgeGraphid
inherited

Definition at line 31 of file AssociationTreeGraphImplObserver.h.

◆ EdgeIndex

template<class N, class E, class TreeGraphImpl>
typedef AssociationGraphObserver<N, E>::EdgeIndex bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::EdgeIndex
inherited

Definition at line 27 of file AssociationTreeGraphImplObserver.h.

◆ EdgeIterator

template<class N, class E>
typedef AssociationGraphObserver<N, E>::EdgeIterator bpp::AssociationTreeGraphObserver< N, E >::EdgeIterator
inherited

Definition at line 183 of file AssociationTreeGraphObserver.h.

◆ Eref

using bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::Eref = std::shared_ptr<E>
inherited

Definition at line 35 of file AssociationGraphImplObserver.h.

◆ NodeGraphid

template<class N, class E, class TreeGraphImpl>
typedef Graph::NodeId bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::NodeGraphid
inherited

Definition at line 29 of file AssociationTreeGraphImplObserver.h.

◆ NodeIndex

template<class N, class E, class TreeGraphImpl>
typedef AssociationGraphObserver<N, E>::NodeIndex bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::NodeIndex
inherited

Definition at line 26 of file AssociationTreeGraphImplObserver.h.

◆ NodeIterator

template<class N, class E>
typedef AssociationGraphObserver<N, E>::NodeIterator bpp::AssociationTreeGraphObserver< N, E >::NodeIterator
inherited

Iterators

Definition at line 182 of file AssociationTreeGraphObserver.h.

◆ Nref

using bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::Nref = std::shared_ptr<N>
inherited

Definition at line 36 of file AssociationGraphImplObserver.h.

Constructor & Destructor Documentation

◆ ComputationTree()

ComputationTree::ComputationTree ( const std::string &  formula,
const std::map< std::string, std::shared_ptr< FunctionInterface >> &  functionNames 
)

Member Function Documentation

◆ addEdgeIndex()

EdgeIndex bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::addEdgeIndex ( const Eref  edgeObject)
inlineinherited

Add an index associated to an edge

Parameters
edgeObjectobject to which one want to set the index
Returns
the given index

Definition at line 852 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::edgeToString().

◆ addNodeIndex()

NodeIndex bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::addNodeIndex ( const Nref  nodeObject)
inlineinherited

Set an new index associated to a node

Parameters
nodeObjectobject to which one want to set the index
Returns
the given index

Definition at line 821 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::nodeToString().

◆ addSon()

template<class N, class E, class TreeGraphImpl>
void bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::addSon ( const std::shared_ptr< N >  nodeObject,
const std::shared_ptr< N >  sonNodeObject,
const std::shared_ptr< E >  edgeObject = 0 
)
inlinevirtualinherited

Add a son to a node

Parameters
nodeObjectthe concerned node
sonNodeObjectthe node to be added as a son to the father
edgeObjectthe optional edge between the nodes (default = 00)

Implements bpp::AssociationTreeGraphObserver< N, E >.

Definition at line 288 of file AssociationTreeGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getEdgeGraphid(), bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getGraph(), and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getNodeGraphid().

◆ allEdgesIterator() [1/3]

◆ allEdgesIterator() [2/3]

std::unique_ptr<typename AssociationGraphObserver<N, E>::EdgeIterator> bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::allEdgesIterator ( )
inlinevirtualinherited

◆ allEdgesIterator() [3/3]

std::unique_ptr<typename AssociationGraphObserver<N, E>::EdgeIterator> bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::allEdgesIterator ( ) const
inlineinherited

Definition at line 1368 of file AssociationGraphImplObserver.h.

◆ allNodesIterator() [1/4]

◆ allNodesIterator() [2/4]

template<class N, class E>
virtual std::unique_ptr<NodeIterator> bpp::AssociationGraphObserver< N, E >::allNodesIterator ( ) const
pure virtualinherited

◆ allNodesIterator() [3/4]

std::unique_ptr<typename AssociationGraphObserver<N, E>::NodeIterator> bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::allNodesIterator ( )
inlinevirtualinherited

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 1025 of file AssociationGraphImplObserver.h.

Referenced by isAllSum().

◆ allNodesIterator() [4/4]

std::unique_ptr<typename AssociationGraphObserver<N, E>::NodeIterator> bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::allNodesIterator ( ) const
inlinevirtualinherited

◆ associateEdge() [1/2]

template<class N, class E>
virtual void bpp::AssociationGraphObserver< N, E >::associateEdge ( std::shared_ptr< E >  edgeObject,
EdgeGraphid  edge 
)
pure virtualinherited

Associate a E object to an edge in the graph.

Parameters
edgeObjectobject to associate
edgeexisting edge to be associated

Implemented in bpp::AssociationGraphImplObserver< N, E, GraphImpl >, bpp::AssociationGraphImplObserver< N, E, DAGraphImpl >, and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >.

Referenced by bpp::AssociationGraphObserver< N, E >::copy().

◆ associateEdge() [2/2]

void bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::associateEdge ( Eref  edgeObject,
EdgeGraphid  graphEdge 
)
inlinevirtualinherited

Associate a E object to an edge in the graph.

Parameters
edgeObjectobject to associate
graphEdgeexisting edge to be associated

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 554 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::edgeToString(), and bpp::AssociationGraphImplObserver< N, E, GraphImpl >::hasEdge().

◆ associateNode() [1/2]

template<class N, class E>
virtual void bpp::AssociationGraphObserver< N, E >::associateNode ( std::shared_ptr< N >  nodeObject,
NodeGraphid  node 
)
pure virtualinherited

Associate a N object to a node in the graph.

Parameters
nodeObjectobject to associate
nodeexisting node to be associated

Implemented in bpp::AssociationGraphImplObserver< N, E, GraphImpl >, bpp::AssociationGraphImplObserver< N, E, DAGraphImpl >, and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >.

Referenced by bpp::AssociationGraphObserver< N, E >::copy().

◆ associateNode() [2/2]

void bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::associateNode ( Nref  nodeObject,
NodeGraphid  graphNode 
)
inlinevirtualinherited

Associate a N object to a node in the graph.

Parameters
nodeObjectobject to associate
graphNodeexisting node to be associated

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 534 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::hasNode(), and bpp::AssociationGraphImplObserver< N, E, GraphImpl >::nodeToString().

◆ branchesIterator() [1/2]

template<class N, class E, class TreeGraphImpl>
std::unique_ptr<typename AssociationTreeGraphObserver<N, E>::EdgeIterator> bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::branchesIterator ( std::shared_ptr< N >  node)
inlinevirtualinherited

◆ branchesIterator() [2/2]

template<class N, class E, class TreeGraphImpl>
std::unique_ptr<typename AssociationTreeGraphObserver<N, E>::EdgeIterator> bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::branchesIterator ( std::shared_ptr< N >  node) const
inlinevirtualinherited

◆ clone()

ComputationTree* bpp::ComputationTree::clone ( ) const
inlinevirtual

clone function

Reimplemented from bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >.

Definition at line 37 of file ComputationTree.h.

References ComputationTree().

◆ copy() [1/5]

template<class N, class E>
template<class A , class B >
static B* bpp::AssociationGraphObserver< N, E >::copy ( const A &  a,
typename std::enable_if< !std::is_base_of< B, A >::value &&!std::is_abstract< B >::value, B *>::type *  = 0 
)
inlinestaticinherited

Specific copy of A and B objects, if clonable or not.

Definition at line 45 of file AssociationGraphObserver.h.

◆ copy() [2/5]

template<class N, class E>
template<class A , class B >
static B* bpp::AssociationGraphObserver< N, E >::copy ( const A &  a,
typename std::enable_if< !std::is_base_of< B, A >::value &&std::is_abstract< B >::value, B *>::type *  = 0 
)
inlinestaticinherited

Definition at line 51 of file AssociationGraphObserver.h.

◆ copy() [3/5]

template<class N, class E>
template<class A , class B >
static B* bpp::AssociationGraphObserver< N, E >::copy ( const A &  a,
typename std::enable_if< std::is_base_of< B, A >::value &&!std::is_abstract< A >::value, B *>::type *  = 0 
)
inlinestaticinherited

Definition at line 58 of file AssociationGraphObserver.h.

◆ copy() [4/5]

template<class N, class E>
template<class A , class B >
static B* bpp::AssociationGraphObserver< N, E >::copy ( const A &  a,
typename std::enable_if< std::is_base_of< B, A >::value &&std::is_abstract< A >::value &&std::is_base_of< Clonable, A >::value, B *>::type *  = 0 
)
inlinestaticinherited

Definition at line 64 of file AssociationGraphObserver.h.

◆ copy() [5/5]

template<class N, class E>
template<class A , class B >
static B* bpp::AssociationGraphObserver< N, E >::copy ( const A &  a,
typename std::enable_if< std::is_base_of< B, A >::value &&std::is_abstract< A >::value &&!std::is_base_of< Clonable, A >::value, B *>::type *  = 0 
)
inlinestaticinherited

Definition at line 70 of file AssociationGraphObserver.h.

References bpp::AssociationGraphObserver< N, E >::associateEdge(), bpp::AssociationGraphObserver< N, E >::associateNode(), bpp::AssociationGraphObserver< N, E >::createNode(), bpp::AssociationGraphObserver< N, E >::deleteNode(), bpp::AssociationGraphObserver< N, E >::dissociateEdge(), bpp::AssociationGraphObserver< N, E >::dissociateNode(), bpp::AssociationGraphObserver< N, E >::getEdge(), bpp::AssociationGraphObserver< N, E >::getEdgeFromGraphid(), bpp::AssociationGraphObserver< N, E >::getEdgeGraphid(), bpp::AssociationGraphObserver< N, E >::getEdgeIndex(), bpp::AssociationGraphObserver< N, E >::getEdgeIndexes(), bpp::AssociationGraphObserver< N, E >::getEdgesFromGraphid(), bpp::AssociationGraphObserver< N, E >::getNode(), bpp::AssociationGraphObserver< N, E >::getNodeFromGraphid(), bpp::AssociationGraphObserver< N, E >::getNodeGraphid(), bpp::AssociationGraphObserver< N, E >::getNodeIndex(), bpp::AssociationGraphObserver< N, E >::getNodeIndexes(), bpp::AssociationGraphObserver< N, E >::getNodesFromGraphid(), bpp::AssociationGraphObserver< N, E >::getRoot(), bpp::AssociationGraphObserver< N, E >::getRootIndex(), bpp::AssociationGraphObserver< N, E >::hasEdge(), bpp::AssociationGraphObserver< N, E >::hasEdgeIndex(), bpp::AssociationGraphObserver< N, E >::hasNode(), bpp::AssociationGraphObserver< N, E >::hasNodeIndex(), bpp::AssociationGraphObserver< N, E >::link(), bpp::AssociationGraphObserver< N, E >::setEdgeIndex(), bpp::AssociationGraphObserver< N, E >::setNodeIndex(), and bpp::AssociationGraphObserver< N, E >::unlink().

◆ createNode() [1/4]

template<class N, class E>
virtual void bpp::AssociationGraphObserver< N, E >::createNode ( std::shared_ptr< N >  newNodeObject)
pure virtualinherited

Creates an orphaned node from a NodeClass object.

Parameters
newNodeObjectthe N object associated to the node in the graph.

Implemented in bpp::AssociationGraphImplObserver< N, E, GraphImpl >, bpp::AssociationGraphImplObserver< N, E, DAGraphImpl >, and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >.

Referenced by bpp::AssociationGraphObserver< N, E >::copy().

◆ createNode() [2/4]

template<class N, class E>
virtual void bpp::AssociationGraphObserver< N, E >::createNode ( std::shared_ptr< N >  objectOriginNode,
std::shared_ptr< N >  newNodeObject,
std::shared_ptr< E >  newEdgeObject = 00 
)
pure virtualinherited

Creates an node linked to an existing node. Order of parameters match the link method.

Parameters
newNodeObjectthe N object associated to the node in the graph.
objectOriginNodeexisting node. In a directed graph: origin -> newNode.
newEdgeObjectoptional edge between nodes (default = 00)

Implemented in bpp::AssociationGraphImplObserver< N, E, GraphImpl >, bpp::AssociationGraphImplObserver< N, E, DAGraphImpl >, and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >.

◆ createNode() [3/4]

void bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::createNode ( Nref  nodeObject)
inlinevirtualinherited

◆ createNode() [4/4]

void bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::createNode ( Nref  objectOriginNode,
Nref  newNodeObject,
Eref  newEdgeObject = 00 
)
inlinevirtualinherited

Creates an node linked to an existing node. Order of parameters match the link method.

Parameters
objectOriginNodeexisting node. In a directed graph: origin -> newNode.
newNodeObjectthe N object associated to the node in the graph.
newEdgeObjectthe optional edge between the nodes (default = 00)

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 455 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::createNode(), and bpp::AssociationGraphImplObserver< N, E, GraphImpl >::link().

◆ deletedEdgesUpdate() [1/2]

virtual void bpp::GraphObserver::deletedEdgesUpdate ( const std::vector< unsigned int > &  edgesToDelete)
pure virtualinherited

Delete unused object edges, since they have been deleted in the graph

Parameters
edgesToDeletea vector of Edges to delete

Implemented in bpp::AssociationGraphImplObserver< N, E, GraphImpl >, bpp::AssociationGraphImplObserver< N, E, DAGraphImpl >, and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >.

◆ deletedEdgesUpdate() [2/2]

void bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::deletedEdgesUpdate ( const std::vector< unsigned int > &  edgesToDelete)
inlinevirtualinherited

Delete unused object edges, since they have been deleted in the graph

Parameters
edgesToDeletea vector of Edges to delete

Implements bpp::GraphObserver.

Definition at line 1477 of file AssociationGraphImplObserver.h.

◆ deletedNodesUpdate() [1/2]

virtual void bpp::GraphObserver::deletedNodesUpdate ( const std::vector< unsigned int > &  nodesToDelete)
pure virtualinherited

Delete unused object nodes, since they have been deleted in the graph

Parameters
nodesToDeletea vector of N to delete

Implemented in bpp::AssociationGraphImplObserver< N, E, GraphImpl >, bpp::AssociationGraphImplObserver< N, E, DAGraphImpl >, and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >.

◆ deletedNodesUpdate() [2/2]

void bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::deletedNodesUpdate ( const std::vector< unsigned int > &  nodesToDelete)
inlinevirtualinherited

Delete unused object nodes, since they have been deleted in the graph

Parameters
nodesToDeletea vector of N to delete

Implements bpp::GraphObserver.

Definition at line 1495 of file AssociationGraphImplObserver.h.

◆ deleteNode() [1/2]

template<class N, class E>
virtual void bpp::AssociationGraphObserver< N, E >::deleteNode ( std::shared_ptr< N >  nodeObject)
pure virtualinherited

◆ deleteNode() [2/2]

void bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::deleteNode ( Nref  nodeObject)
inlinevirtualinherited

◆ dissociateEdge() [1/2]

template<class N, class E>
virtual void bpp::AssociationGraphObserver< N, E >::dissociateEdge ( std::shared_ptr< E >  edgeObject)
pure virtualinherited

◆ dissociateEdge() [2/2]

void bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::dissociateEdge ( Eref  edgeObject)
inlinevirtualinherited

◆ dissociateNode() [1/2]

template<class N, class E>
virtual void bpp::AssociationGraphObserver< N, E >::dissociateNode ( std::shared_ptr< N >  nodeObject)
pure virtualinherited

Dissociate a N or E object to a node or an edge in the graph. Graph is not changed.

Parameters
nodeObjectobject to dissociate

Implemented in bpp::AssociationGraphImplObserver< N, E, GraphImpl >, bpp::AssociationGraphImplObserver< N, E, DAGraphImpl >, and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >.

Referenced by bpp::AssociationGraphObserver< N, E >::copy().

◆ dissociateNode() [2/2]

void bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::dissociateNode ( Nref  nodeObject)
inlinevirtualinherited

Dissociate a N or E object to a node or an edge in the graph.

Parameters
nodeObjectobject to dissociate

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 573 of file AssociationGraphImplObserver.h.

◆ edgeToString()

◆ getAllEdges() [1/2]

template<class N, class E>
virtual std::vector<std::shared_ptr<E> > bpp::AssociationGraphObserver< N, E >::getAllEdges ( ) const
pure virtualinherited

◆ getAllEdges() [2/2]

std::vector<Eref > bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getAllEdges ( ) const
inlinevirtualinherited

Get all the defined branches of a graph,

Returns
a vector containing the branchesObjects

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 1405 of file AssociationGraphImplObserver.h.

◆ getAllEdgesIndexes() [1/2]

◆ getAllEdgesIndexes() [2/2]

std::vector<EdgeIndex> bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getAllEdgesIndexes ( ) const
inlinevirtualinherited

Get indexes of all defined edges of a graph,

Returns
a vector containing the edgesObjects

They are in the same order as the graphIds (and not necessary Indexes).

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 1316 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getEdgeIndex().

◆ getAllInnerNodes() [1/2]

template<class N, class E>
virtual std::vector<std::shared_ptr<N> > bpp::AssociationGraphObserver< N, E >::getAllInnerNodes ( ) const
pure virtualinherited

◆ getAllInnerNodes() [2/2]

std::vector<Nref > bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getAllInnerNodes ( ) const
inlinevirtualinherited

Get all the inner nodes of a graph, ie, nodes with degree >= 2.

Returns
a vector containing the inner nodes.

They are in the same order as the graphIds (and not necessary Indexes).

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 1236 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getGraph().

◆ getAllInnerNodesIndexes() [1/2]

◆ getAllInnerNodesIndexes() [2/2]

std::vector<NodeIndex> bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getAllInnerNodesIndexes ( ) const
inlinevirtualinherited

Get the indexes of all inner nodes of a graph, ie, nodes with degree >= 2.

Returns
a vector containing the inner nodes.

They are in the same order as the graphIds (and not necessary Indexes).

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 1257 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getGraph(), and bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getNodeIndex().

◆ getAllLeaves() [1/2]

template<class N, class E>
virtual std::vector<std::shared_ptr<N> > bpp::AssociationGraphObserver< N, E >::getAllLeaves ( ) const
pure virtualinherited

◆ getAllLeaves() [2/2]

std::vector<Nref > bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getAllLeaves ( ) const
inlinevirtualinherited

Get all the leaves objects of a graph, ie, nodes with only one neighbor,

Returns
a vector containing the leaves

They are in the same order as the graphIds (and not necessary Indexes).

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 1193 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getGraph().

◆ getAllLeavesIndexes() [1/2]

◆ getAllLeavesIndexes() [2/2]

std::vector<NodeIndex> bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getAllLeavesIndexes ( ) const
inlinevirtualinherited

Get index of the leaves objects of a graph, ie, nodes with only one neighbor,

Returns
a vector containing the leaves

They are in the same order as the graphIds (and not necessary Indexes).

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 1214 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getGraph(), and bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getNodeIndex().

◆ getAllNodes() [1/2]

template<class N, class E>
virtual std::vector<std::shared_ptr<N> > bpp::AssociationGraphObserver< N, E >::getAllNodes ( ) const
pure virtualinherited

◆ getAllNodes() [2/2]

std::vector<Nref > bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getAllNodes ( ) const
inlinevirtualinherited

Get all the defined nodes of a graph,

Returns
a vector containing the nodesObjects

They are in the same order as the graphIds (and not necessary Indexes).

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 1278 of file AssociationGraphImplObserver.h.

◆ getAllNodesIndexes() [1/2]

◆ getAllNodesIndexes() [2/2]

std::vector<NodeIndex> bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getAllNodesIndexes ( ) const
inlinevirtualinherited

Get indexes of all defined nodes of a graph,

Returns
a vector containing the nodesObjects

They are in the same order as the graphIds (and not necessary Indexes).

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 1297 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getNodeIndex().

◆ getBranches() [1/2]

template<class N, class E, class TreeGraphImpl>
std::vector<std::shared_ptr<E> > bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getBranches ( const std::shared_ptr< N >  node) const
inlinevirtualinherited

◆ getBranches() [2/2]

◆ getDegree()

size_t bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getDegree ( const Nref  node) const
inlineinherited

Return the number of neighbors of a node

Parameters
nodethe concerned node
Returns
the number of neighbors

Definition at line 1559 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getGraph(), and bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getNodeGraphid().

◆ getEdge() [1/2]

template<class N, class E>
virtual std::shared_ptr<E> bpp::AssociationGraphObserver< N, E >::getEdge ( EdgeIndex  edgeIndex) const
pure virtualinherited

Return the associated Node index

Parameters
edgeIndexthe index of the wanted edge
Returns
E, an edge object

Implemented in bpp::AssociationGraphImplObserver< N, E, GraphImpl >, bpp::AssociationGraphImplObserver< N, E, DAGraphImpl >, and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >.

Referenced by bpp::AssociationGraphObserver< N, E >::copy().

◆ getEdge() [2/2]

Eref bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getEdge ( EdgeIndex  edge) const
inlinevirtualinherited

Return the associated Node index

Parameters
edgeobject which to return the node index
Returns
a node index

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 911 of file AssociationGraphImplObserver.h.

Referenced by bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getFatherOfEdge(), and bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getSon().

◆ getEdgeFromGraphid() [1/4]

◆ getEdgeFromGraphid() [2/4]

template<class N, class E>
virtual const std::shared_ptr<E> bpp::AssociationGraphObserver< N, E >::getEdgeFromGraphid ( EdgeGraphid  ) const
pure virtualinherited

◆ getEdgeFromGraphid() [3/4]

◆ getEdgeFromGraphid() [4/4]

const Eref bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getEdgeFromGraphid ( EdgeGraphid  edge) const
inlinevirtualinherited

◆ getEdgeGraphid() [1/2]

template<class N, class E>
virtual EdgeGraphid bpp::AssociationGraphObserver< N, E >::getEdgeGraphid ( const std::shared_ptr< E >  edgeObject) const
pure virtualinherited

Return the associated Node ID

Parameters
edgeObjectobject which to return the node ID
Returns
a node ID

Implemented in bpp::AssociationGraphImplObserver< N, E, GraphImpl >, bpp::AssociationGraphImplObserver< N, E, DAGraphImpl >, and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >.

Referenced by bpp::AssociationGraphObserver< N, E >::copy().

◆ getEdgeGraphid() [2/2]

◆ getEdgeIndex() [1/2]

template<class N, class E>
virtual EdgeIndex bpp::AssociationGraphObserver< N, E >::getEdgeIndex ( const std::shared_ptr< E >  edgeObject) const
pure virtualinherited

Return the associated Node index

Parameters
edgeObjectobject which to return the node index
Returns
a node index

Implemented in bpp::AssociationGraphImplObserver< N, E, GraphImpl >, bpp::AssociationGraphImplObserver< N, E, DAGraphImpl >, and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >.

Referenced by bpp::AssociationGraphObserver< N, E >::copy().

◆ getEdgeIndex() [2/2]

EdgeIndex bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getEdgeIndex ( const Eref  edgeObject) const
inlinevirtualinherited

Return the associated Node index

Parameters
edgeObjectobject which to return the node index
Returns
a node index

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 751 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::edgeToString().

◆ getEdgeIndexes() [1/2]

template<class N, class E>
virtual std::vector<EdgeIndex> bpp::AssociationGraphObserver< N, E >::getEdgeIndexes ( std::vector< std::shared_ptr< E >>  edgeObjects) const
pure virtualinherited

◆ getEdgeIndexes() [2/2]

◆ getEdgeLinking() [1/2]

template<class N, class E>
virtual std::shared_ptr<E> bpp::AssociationGraphObserver< N, E >::getEdgeLinking ( std::shared_ptr< N >  nodeA,
std::shared_ptr< N >  nodeB 
) const
pure virtualinherited

Returns the Edge between two nodes nodeA -> nodeB

Parameters
nodeAsource node (if directed)
nodeBdestination node (if directed)
Returns
the edge between these two nodes

Implemented in bpp::AssociationGraphImplObserver< N, E, GraphImpl >, bpp::AssociationGraphImplObserver< N, E, DAGraphImpl >, and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >.

Referenced by bpp::AssociationGraphObserver< N, E >::EdgeIterator::~EdgeIterator().

◆ getEdgeLinking() [2/2]

Eref bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getEdgeLinking ( Nref  nodeA,
Nref  nodeB 
) const
inlinevirtualinherited

Returns the Edge between two nodes nodeA -> nodeB

Parameters
nodeAsource node (if directed)
nodeBdestination node (if directed)
Returns
the edge between these two nodes, or 0 if edge does not exist

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 1449 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getEdge(), bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getEdgeFromGraphid(), bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getGraph(), and bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getNodeGraphid().

◆ getEdgePathBetweenTwoNodes() [1/2]

template<class N, class E, class TreeGraphImpl>
std::vector<std::shared_ptr<E> > bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getEdgePathBetweenTwoNodes ( const std::shared_ptr< N >  nodeA,
const std::shared_ptr< N >  nodeB 
) const
inlinevirtualinherited

◆ getEdgePathBetweenTwoNodes() [2/2]

template<class N, class E, class TreeGraphImpl>
std::vector<EdgeIndex> bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getEdgePathBetweenTwoNodes ( const NodeIndex  nodeA,
const NodeIndex  nodeB,
bool  includeAncestor = true 
) const
inlineinherited

◆ getEdges() [1/4]

template<class N, class E>
virtual std::vector<std::shared_ptr<E> > bpp::AssociationGraphObserver< N, E >::getEdges ( const std::shared_ptr< N >  node) const
pure virtualinherited

Get all the edges from/to a node in the graph.

Parameters
nodethe node one wants to get its neighbor edges
Returns
a vector containing the edges

Implemented in bpp::AssociationGraphImplObserver< N, E, GraphImpl >, bpp::AssociationGraphImplObserver< N, E, DAGraphImpl >, and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >.

Referenced by bpp::AssociationGraphObserver< N, E >::NodeIterator::~NodeIterator().

◆ getEdges() [2/4]

◆ getEdges() [3/4]

std::vector<Eref > bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getEdges ( const Nref  node) const
inlinevirtualinherited

◆ getEdges() [4/4]

◆ getEdgesFromGraphid() [1/2]

template<class N, class E>
virtual std::vector<std::shared_ptr<E> > bpp::AssociationGraphObserver< N, E >::getEdgesFromGraphid ( std::vector< EdgeGraphid ) const
pure virtualinherited

◆ getEdgesFromGraphid() [2/2]

◆ getEdgeToFather() [1/2]

template<class N, class E, class TreeGraphImpl>
std::shared_ptr<E> bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getEdgeToFather ( const std::shared_ptr< N >  nodeObject) const
inlinevirtualinherited

◆ getEdgeToFather() [2/2]

◆ getFatherOfEdge() [1/2]

template<class N, class E, class TreeGraphImpl>
std::shared_ptr<N> bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getFatherOfEdge ( const std::shared_ptr< E >  edge) const
inlinevirtualinherited

◆ getFatherOfEdge() [2/2]

◆ getFatherOfNode()

template<class N, class E, class TreeGraphImpl>
std::shared_ptr<N> bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getFatherOfNode ( const std::shared_ptr< N >  nodeObject) const
inlinevirtualinherited

◆ getFirstOrderDerivative()

double bpp::ComputationTree::getFirstOrderDerivative ( const std::string &  variable) const
inline

◆ getGraph() [1/2]

const std::shared_ptr<TreeGraphImpl > bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getGraph ( ) const
inlineinherited

Definition at line 315 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::subjectGraph_.

Referenced by bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::addSon(), ComputationTree(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getBranches(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getEdgePathBetweenTwoNodes(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getEdgeToFather(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getFatherOfEdge(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getFatherOfNode(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getLeavesUnderNode(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getNodePathBetweenTwoNodes(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getNumberOfSons(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getSon(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getSons(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getSubtreeEdges(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getSubtreeNodes(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::hasFather(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::isRooted(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::isValid(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::MRCA(), readFormula_(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::removeSon(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::removeSons(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::rootAt(), and bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::setFather().

◆ getGraph() [2/2]

◆ getIncomingEdges() [1/4]

template<class N, class E>
virtual std::vector<std::shared_ptr<E> > bpp::AssociationGraphObserver< N, E >::getIncomingEdges ( const std::shared_ptr< N >  node) const
pure virtualinherited

In an directed graph, get all the edges which are coming to a node in the graph.

Parameters
nodethe node one wants to get its edges
Returns
a vector containing the incoming edges

Implemented in bpp::AssociationGraphImplObserver< N, E, GraphImpl >, bpp::AssociationGraphImplObserver< N, E, DAGraphImpl >, and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >.

Referenced by bpp::AssociationGraphObserver< N, E >::NodeIterator::~NodeIterator().

◆ getIncomingEdges() [2/4]

template<class N, class E>
virtual std::vector<EdgeIndex> bpp::AssociationGraphObserver< N, E >::getIncomingEdges ( NodeIndex  node) const
pure virtualinherited

◆ getIncomingEdges() [3/4]

std::vector<Eref > bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getIncomingEdges ( const Nref  node) const
inlinevirtualinherited

In an directed graph, get all the edges which are coming to a node in the graph.

Parameters
nodethe node one wants to get its edges
Returns
a vector containing the incoming edges

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 1162 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getEdgesFromGraphid(), bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getGraph(), bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getIncomingEdges(), and bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getNodeGraphid().

◆ getIncomingEdges() [4/4]

◆ getIncomingNeighbors() [1/4]

template<class N, class E>
virtual std::vector<std::shared_ptr<N> > bpp::AssociationGraphObserver< N, E >::getIncomingNeighbors ( const std::shared_ptr< N >  node) const
pure virtualinherited

In an directed graph, get all the neighbors which are coming to a node in the graph.

Parameters
nodethe node one wants to get its neighbors
Returns
a vector containing the incoming neighbors

Implemented in bpp::AssociationGraphImplObserver< N, E, GraphImpl >, bpp::AssociationGraphImplObserver< N, E, DAGraphImpl >, and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >.

Referenced by bpp::AssociationGraphObserver< N, E >::NodeIterator::~NodeIterator().

◆ getIncomingNeighbors() [2/4]

template<class N, class E>
virtual std::vector<NodeIndex> bpp::AssociationGraphObserver< N, E >::getIncomingNeighbors ( NodeIndex  node) const
pure virtualinherited

◆ getIncomingNeighbors() [3/4]

std::vector<Nref > bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getIncomingNeighbors ( const Nref  node) const
inlinevirtualinherited

In an directed graph, get all the neighbors which are coming to a node in the graph.

Parameters
nodethe node one wants to get its neighbors
Returns
a vector containing the incoming neighbors

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 1145 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getGraph(), bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getIncomingNeighbors(), bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getNodeGraphid(), and bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getNodesFromGraphid().

◆ getIncomingNeighbors() [4/4]

◆ getLeavesFromNode() [1/2]

template<class N, class E>
virtual std::vector<std::shared_ptr<N> > bpp::AssociationGraphObserver< N, E >::getLeavesFromNode ( std::shared_ptr< N >  node,
unsigned int  maxDepth 
) const
pure virtualinherited

Get the leaves of a graph, ie, nodes with only one neighbor, starting from a peculiar node, up to a specific depth.

Parameters
nodethe starting node
maxDepththe max recursion depth
Returns
a vector containing the leaves

Implemented in bpp::AssociationGraphImplObserver< N, E, GraphImpl >, bpp::AssociationGraphImplObserver< N, E, DAGraphImpl >, and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >.

Referenced by bpp::AssociationGraphObserver< N, E >::NodeIterator::~NodeIterator().

◆ getLeavesFromNode() [2/2]

std::vector<Nref > bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getLeavesFromNode ( Nref  node,
unsigned int  maxDepth 
) const
inlinevirtualinherited

Get the leaves of a graph, ie, nodes with only one neighbor, starting from a peculiar node, with maxDepth recursion depths.

Parameters
nodethe starting node
maxDepththe max recursion depth
Returns
a vector containing the leaves

They are in the same order as the graphIds (and not necessary Indexes).

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 1182 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getGraph(), bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getLeavesFromNode(), bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getNodeGraphid(), and bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getNodesFromGraphid().

◆ getLeavesUnderNode() [1/2]

template<class N, class E, class TreeGraphImpl>
std::vector<std::shared_ptr<N> > bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getLeavesUnderNode ( std::shared_ptr< N >  node) const
inlinevirtualinherited

◆ getLeavesUnderNode() [2/2]

◆ getNeighbors() [1/4]

template<class N, class E>
virtual std::vector<std::shared_ptr<N> > bpp::AssociationGraphObserver< N, E >::getNeighbors ( const std::shared_ptr< N >  node) const
pure virtualinherited

Get all the neighbors of a node in the graph.

Parameters
nodethe node one wants to get its neighbors
Returns
a vector containing the neighbors

Implemented in bpp::AssociationGraphImplObserver< N, E, GraphImpl >, bpp::AssociationGraphImplObserver< N, E, DAGraphImpl >, and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >.

Referenced by bpp::AssociationGraphObserver< N, E >::NodeIterator::~NodeIterator().

◆ getNeighbors() [2/4]

◆ getNeighbors() [3/4]

std::vector<Nref > bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getNeighbors ( const Nref  node) const
inlinevirtualinherited

Get all the neighbors of a node in the graph.

Parameters
nodethe node one wants to get its neighbors
Returns
a vector containing the neighbors

They are in the same order as the graphIds (and not necessary Indexes).

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 1073 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getGraph(), bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getNeighbors(), bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getNodeGraphid(), and bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getNodesFromGraphid().

◆ getNeighbors() [4/4]

std::vector<NodeIndex> bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getNeighbors ( NodeIndex  node) const
inlinevirtualinherited

Get the index of all neighbors of a node in the graph.

Parameters
nodethe node one wants to get its neighbors
Returns
a vector containing the neighbors

They are in the same order as the graphIds (and not necessary Indexes).

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 1085 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getNeighbors(), bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getNode(), and bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getNodeIndexes().

◆ getNode() [1/2]

template<class N, class E>
virtual std::shared_ptr<N> bpp::AssociationGraphObserver< N, E >::getNode ( NodeIndex  nodeIndex) const
pure virtualinherited

Return the associated Node, querying with an index

Parameters
nodeIndexthe index of the wanted node
Returns
N, a node object

Implemented in bpp::AssociationGraphImplObserver< N, E, GraphImpl >, bpp::AssociationGraphImplObserver< N, E, DAGraphImpl >, and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >.

Referenced by bpp::AssociationGraphObserver< N, E >::copy().

◆ getNode() [2/2]

◆ getNodeFromGraphid() [1/4]

template<class N, class E>
virtual const std::shared_ptr<N> bpp::AssociationGraphObserver< N, E >::getNodeFromGraphid ( NodeGraphid  ) const
pure virtualinherited

◆ getNodeFromGraphid() [2/4]

template<class N, class E>
virtual std::shared_ptr<N> bpp::AssociationGraphObserver< N, E >::getNodeFromGraphid ( NodeGraphid  )
pure virtualinherited

◆ getNodeFromGraphid() [3/4]

◆ getNodeFromGraphid() [4/4]

const Nref bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getNodeFromGraphid ( NodeGraphid  node) const
inlinevirtualinherited

Transforms an (a list of) id(s) into an (a list of) object(s)

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 627 of file AssociationGraphImplObserver.h.

◆ getNodeGraphid() [1/2]

template<class N, class E>
virtual NodeGraphid bpp::AssociationGraphObserver< N, E >::getNodeGraphid ( const std::shared_ptr< N >  nodeObject) const
pure virtualinherited

Return the associated Node ID

Parameters
nodeObjectobject which to return the node ID
Returns
a node ID

Implemented in bpp::AssociationGraphImplObserver< N, E, GraphImpl >, bpp::AssociationGraphImplObserver< N, E, DAGraphImpl >, and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >.

Referenced by bpp::AssociationGraphObserver< N, E >::copy().

◆ getNodeGraphid() [2/2]

NodeGraphid bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getNodeGraphid ( const Nref  nodeObject) const
inlinevirtualinherited

Return the associated Node ID

Parameters
nodeObjectobject which to return the node ID
Returns
a node ID

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 594 of file AssociationGraphImplObserver.h.

References bpp::TextTools::toString().

Referenced by bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::addSon(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getBranches(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getEdgePathBetweenTwoNodes(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getEdgeToFather(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getFatherOfNode(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getLeavesUnderNode(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getNodePathBetweenTwoNodes(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getNumberOfSons(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getSons(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getSubtreeEdges(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getSubtreeNodes(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::hasFather(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::MRCA(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::removeSon(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::removeSons(), bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::rootAt(), and bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::setFather().

◆ getNodeIndex() [1/2]

template<class N, class E>
virtual NodeIndex bpp::AssociationGraphObserver< N, E >::getNodeIndex ( const std::shared_ptr< N >  nodeObject) const
pure virtualinherited

Return the associated Node index

Parameters
nodeObjectobject which to return the node index
Returns
a node index

Implemented in bpp::AssociationGraphImplObserver< N, E, GraphImpl >, bpp::AssociationGraphImplObserver< N, E, DAGraphImpl >, and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >.

Referenced by bpp::AssociationGraphObserver< N, E >::copy().

◆ getNodeIndex() [2/2]

NodeIndex bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getNodeIndex ( const Nref  nodeObject) const
inlinevirtualinherited

◆ getNodeIndexes() [1/2]

template<class N, class E>
virtual std::vector<NodeIndex> bpp::AssociationGraphObserver< N, E >::getNodeIndexes ( std::vector< std::shared_ptr< N >>  nodeObjects) const
pure virtualinherited

◆ getNodeIndexes() [2/2]

◆ getNodePathBetweenTwoNodes() [1/2]

template<class N, class E, class TreeGraphImpl>
std::vector<std::shared_ptr<N> > bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getNodePathBetweenTwoNodes ( const std::shared_ptr< N >  nodeA,
const std::shared_ptr< N >  nodeB,
bool  includeAncestor = true 
) const
inlinevirtualinherited

Get a vector of ancestor nodes between to nodes.

Parameters
nodeAfirst node.
nodeBsecond node.
includeAncestorTell if the common ancestor must be included in the vector.
Returns
A vector of ancestor nodes ids.
Exceptions
PhyloNodeNotFoundExceptionIf a node is not found.

Implements bpp::AssociationTreeGraphObserver< N, E >.

Definition at line 338 of file AssociationTreeGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getGraph(), bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getNodeGraphid(), and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getNodesFromGraphid().

Referenced by bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getNodePathBetweenTwoNodes().

◆ getNodePathBetweenTwoNodes() [2/2]

template<class N, class E, class TreeGraphImpl>
std::vector<NodeIndex> bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getNodePathBetweenTwoNodes ( const NodeIndex  nodeA,
const NodeIndex  nodeB,
bool  includeAncestor = true 
) const
inlineinherited

◆ getNodes()

std::pair<Nref, Nref> bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getNodes ( Eref  edge) const
inlineinherited

Get nodes located at the extremities of an edge

Parameters
edgean edge
Returns
a pair of the Nodes at each extremity of the edge example : N1–E1–>N2; getNodes(E1) will return (N1,N2);

Definition at line 1437 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getEdgeGraphid(), bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getGraph(), and bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getNodeFromGraphid().

◆ getNodesFromGraphid() [1/2]

template<class N, class E>
virtual std::vector<std::shared_ptr<N> > bpp::AssociationGraphObserver< N, E >::getNodesFromGraphid ( std::vector< NodeGraphid ) const
pure virtualinherited

◆ getNodesFromGraphid() [2/2]

◆ getNumberOfEdges()

size_t bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getNumberOfEdges ( ) const
inlineinherited

Return the number of defined edges, ie edges that have a corresponding object in this GraphObserver

Returns
the number of edges

Definition at line 1531 of file AssociationGraphImplObserver.h.

◆ getNumberOfLeaves()

size_t bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getNumberOfLeaves ( ) const
inlineinherited

Return the number of defined leaves, ie leaves that have a corresponding object in this GraphObserver

Returns
the number of leaves

Definition at line 1542 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::isLeaf().

◆ getNumberOfNodes()

size_t bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getNumberOfNodes ( ) const
inlineinherited

Return the number of defined nodes, ie nodes that have a corresponding object in this GraphObserver

Returns
the number of nodes

Definition at line 1521 of file AssociationGraphImplObserver.h.

◆ getNumberOfSons()

template<class N, class E, class TreeGraphImpl>
size_t bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getNumberOfSons ( const std::shared_ptr< N >  node) const
inlinevirtualinherited

Return, in a rooted tree, the number of sons

Parameters
nodethe concerned node
Returns
the number of sons

Implements bpp::AssociationTreeGraphObserver< N, E >.

Definition at line 227 of file AssociationTreeGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getGraph(), and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getNodeGraphid().

◆ getOutgoingEdges() [1/4]

template<class N, class E>
virtual std::vector<std::shared_ptr<E> > bpp::AssociationGraphObserver< N, E >::getOutgoingEdges ( const std::shared_ptr< N >  node) const
pure virtualinherited

In an directed graph, get all the edges which are leaving a node in the graph.

Parameters
nodethe node one wants to get its edges
Returns
a vector containing the outgoing edges

Implemented in bpp::AssociationGraphImplObserver< N, E, GraphImpl >, bpp::AssociationGraphImplObserver< N, E, DAGraphImpl >, and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >.

Referenced by bpp::AssociationGraphObserver< N, E >::NodeIterator::~NodeIterator().

◆ getOutgoingEdges() [2/4]

template<class N, class E>
virtual std::vector<EdgeIndex> bpp::AssociationGraphObserver< N, E >::getOutgoingEdges ( NodeIndex  node) const
pure virtualinherited

◆ getOutgoingEdges() [3/4]

std::vector<Eref > bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getOutgoingEdges ( const Nref  node) const
inlinevirtualinherited

In an directed graph, get all the edges which are leaving a node in the graph.

Parameters
nodethe node one wants to get its edges
Returns
a vector containing the outgoing edges

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 1129 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getEdgesFromGraphid(), bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getGraph(), bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getNodeGraphid(), and bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getOutgoingEdges().

◆ getOutgoingEdges() [4/4]

◆ getOutgoingNeighbors() [1/4]

template<class N, class E>
virtual std::vector<std::shared_ptr<N> > bpp::AssociationGraphObserver< N, E >::getOutgoingNeighbors ( const std::shared_ptr< N >  node) const
pure virtualinherited

In an directed graph, get all the neighbors which are leaving a node in the graph.

Parameters
nodethe node one wants to get its neighbors
Returns
a vector containing the outgoing neighbors

Implemented in bpp::AssociationGraphImplObserver< N, E, GraphImpl >, bpp::AssociationGraphImplObserver< N, E, DAGraphImpl >, and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >.

Referenced by bpp::AssociationGraphObserver< N, E >::NodeIterator::~NodeIterator().

◆ getOutgoingNeighbors() [2/4]

template<class N, class E>
virtual std::vector<NodeIndex> bpp::AssociationGraphObserver< N, E >::getOutgoingNeighbors ( NodeIndex  node) const
pure virtualinherited

◆ getOutgoingNeighbors() [3/4]

std::vector<Nref > bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getOutgoingNeighbors ( const Nref  node) const
inlinevirtualinherited

In an directed graph, get all the neighbors which are leaving a node in the graph.

Parameters
nodethe node one wants to get its neighbors
Returns
a vector containing the outgoing neighbors

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 1113 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getGraph(), bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getNodeGraphid(), bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getNodesFromGraphid(), and bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getOutgoingNeighbors().

◆ getOutgoingNeighbors() [4/4]

◆ getRoot() [1/2]

template<class N, class E>
virtual std::shared_ptr<N> bpp::AssociationGraphObserver< N, E >::getRoot ( ) const
pure virtualinherited

◆ getRoot() [2/2]

◆ getRootIndex() [1/2]

◆ getRootIndex() [2/2]

◆ getSecondOrderDerivative()

double bpp::ComputationTree::getSecondOrderDerivative ( const std::string &  variable) const
inline

◆ getSon() [1/2]

template<class N, class E, class TreeGraphImpl>
std::shared_ptr<N> bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getSon ( const std::shared_ptr< E >  edge) const
inlinevirtualinherited

◆ getSon() [2/2]

◆ getSons() [1/2]

template<class N, class E, class TreeGraphImpl>
std::vector<std::shared_ptr<N> > bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::getSons ( const std::shared_ptr< N >  node) const
inlinevirtualinherited

◆ getSons() [2/2]

◆ getSubtreeEdges() [1/2]

◆ getSubtreeEdges() [2/2]

◆ getSubtreeNodes() [1/2]

◆ getSubtreeNodes() [2/2]

◆ getValue()

double bpp::ComputationTree::getValue ( ) const
inline

◆ hasEdge() [1/3]

template<class N, class E>
virtual bool bpp::AssociationGraphObserver< N, E >::hasEdge ( EdgeIndex  edgeIndex) const
pure virtualinherited

◆ hasEdge() [2/3]

bool bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::hasEdge ( Eref  edgeObject) const
inlineinherited

Definition at line 337 of file AssociationGraphImplObserver.h.

◆ hasEdge() [3/3]

bool bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::hasEdge ( EdgeIndex  edge) const
inlinevirtualinherited

Return if has Edge matching EdgeIndex

Parameters
edgeEdgeIndex index

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 891 of file AssociationGraphImplObserver.h.

◆ hasEdgeIndex() [1/2]

template<class N, class E>
virtual bool bpp::AssociationGraphObserver< N, E >::hasEdgeIndex ( const std::shared_ptr< E >  edgeObject) const
pure virtualinherited

◆ hasEdgeIndex() [2/2]

bool bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::hasEdgeIndex ( const Eref  edgeObject) const
inlinevirtualinherited

◆ hasFather() [1/2]

template<class N, class E, class TreeGraphImpl>
bool bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::hasFather ( const std::shared_ptr< N >  nodeObject) const
inlinevirtualinherited

◆ hasFather() [2/2]

◆ hasNode() [1/3]

template<class N, class E>
virtual bool bpp::AssociationGraphObserver< N, E >::hasNode ( NodeIndex  nodeIndex) const
pure virtualinherited

◆ hasNode() [2/3]

bool bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::hasNode ( Nref  nodeObject) const
inlineinherited

Definition at line 330 of file AssociationGraphImplObserver.h.

◆ hasNode() [3/3]

bool bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::hasNode ( NodeIndex  node) const
inlinevirtualinherited

Return if has Node matching NodeIndex

Parameters
nodeNodeIndex index

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 882 of file AssociationGraphImplObserver.h.

◆ hasNodeIndex() [1/2]

template<class N, class E>
virtual bool bpp::AssociationGraphObserver< N, E >::hasNodeIndex ( const std::shared_ptr< N >  nodeObject) const
pure virtualinherited

◆ hasNodeIndex() [2/2]

bool bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::hasNodeIndex ( const Nref  nodeObject) const
inlinevirtualinherited

return if the object has an index.

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 713 of file AssociationGraphImplObserver.h.

◆ incomingEdgesIterator() [1/3]

◆ incomingEdgesIterator() [2/3]

std::unique_ptr<typename AssociationGraphObserver<N, E>::EdgeIterator> bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::incomingEdgesIterator ( Nref  node)
inlinevirtualinherited

◆ incomingEdgesIterator() [3/3]

std::unique_ptr<typename AssociationGraphObserver<N, E>::EdgeIterator> bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::incomingEdgesIterator ( Nref  node) const
inlineinherited

Definition at line 1396 of file AssociationGraphImplObserver.h.

◆ incomingNeighborNodesIterator() [1/4]

template<class N, class E>
virtual std::unique_ptr<NodeIterator> bpp::AssociationGraphObserver< N, E >::incomingNeighborNodesIterator ( std::shared_ptr< N >  node)
pure virtualinherited

◆ incomingNeighborNodesIterator() [2/4]

template<class N, class E>
virtual std::unique_ptr<NodeIterator> bpp::AssociationGraphObserver< N, E >::incomingNeighborNodesIterator ( std::shared_ptr< N >  node) const
pure virtualinherited

◆ incomingNeighborNodesIterator() [3/4]

std::unique_ptr<typename AssociationGraphObserver<N, E>::NodeIterator> bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::incomingNeighborNodesIterator ( Nref  node)
inlinevirtualinherited

◆ incomingNeighborNodesIterator() [4/4]

std::unique_ptr<typename AssociationGraphObserver<N, E>::NodeIterator> bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::incomingNeighborNodesIterator ( Nref  node) const
inlinevirtualinherited

◆ isAllSum()

◆ isLeaf() [1/2]

◆ isLeaf() [2/2]

◆ isRooted()

template<class N, class E, class TreeGraphImpl>
bool bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::isRooted ( ) const
inlinevirtualinherited

◆ isValid()

template<class N, class E, class TreeGraphImpl>
bool bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::isValid ( ) const
inlinevirtualinherited

Is the graph a tree? A tree must be acyclic and with no isolated node.

Returns
true if valid tree

Implements bpp::AssociationTreeGraphObserver< N, E >.

Definition at line 99 of file AssociationTreeGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getGraph().

◆ link() [1/2]

template<class N, class E>
virtual void bpp::AssociationGraphObserver< N, E >::link ( std::shared_ptr< N >  nodeObjectA,
std::shared_ptr< N >  nodeObjectB,
std::shared_ptr< E >  edgeObject = 00 
)
pure virtualinherited

Creates a link between two existing nodes. If directed graph: nodeA -> nodeB.

Parameters
nodeObjectAsource node (or first node if undirected)
nodeObjectBtarget node (or second node if undirected)
edgeObjectthe optional edge between the nodes (default = 00)

Implemented in bpp::AssociationGraphImplObserver< N, E, GraphImpl >, bpp::AssociationGraphImplObserver< N, E, DAGraphImpl >, and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >.

Referenced by bpp::AssociationGraphObserver< N, E >::copy().

◆ link() [2/2]

void bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::link ( Nref  nodeObjectA,
Nref  nodeObjectB,
Eref  edgeObject = 00 
)
inlinevirtualinherited

Creates a link between two existing nodes. If directed graph: nodeA -> nodeB.

Parameters
nodeObjectAsource node (or first node if undirected)
nodeObjectBtarget node (or second node if undirected)
edgeObjectthe optional edge between the nodes (default = 00)

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 470 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::edgeToString(), bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getGraph(), bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getNodes(), bpp::AssociationGraphImplObserver< N, E, GraphImpl >::hasEdge(), bpp::AssociationGraphImplObserver< N, E, GraphImpl >::hasNode(), and bpp::AssociationGraphImplObserver< N, E, GraphImpl >::nodeToString().

◆ MRCA()

template<class N, class E, class TreeGraphImpl>
std::shared_ptr<N> bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::MRCA ( const std::vector< std::shared_ptr< N >>  vNodeObject) const
inlineinherited

Return, in a rooted tree, the MRCA node of a vector of nodes

Parameters
vNodeObjectthe vector of concerned nodes
Returns
the MRCA

Definition at line 383 of file AssociationTreeGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getGraph(), bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getNodeFromGraphid(), and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getNodeGraphid().

◆ nodeToString()

◆ outgoingEdgesIterator() [1/3]

◆ outgoingEdgesIterator() [2/3]

std::unique_ptr<typename AssociationGraphObserver<N, E>::EdgeIterator> bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::outgoingEdgesIterator ( Nref  node)
inlinevirtualinherited

◆ outgoingEdgesIterator() [3/3]

std::unique_ptr<typename AssociationGraphObserver<N, E>::EdgeIterator> bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::outgoingEdgesIterator ( Nref  node) const
inlineinherited

Definition at line 1382 of file AssociationGraphImplObserver.h.

◆ outgoingNeighborNodesIterator() [1/4]

template<class N, class E>
virtual std::unique_ptr<NodeIterator> bpp::AssociationGraphObserver< N, E >::outgoingNeighborNodesIterator ( std::shared_ptr< N >  node)
pure virtualinherited

◆ outgoingNeighborNodesIterator() [2/4]

template<class N, class E>
virtual std::unique_ptr<NodeIterator> bpp::AssociationGraphObserver< N, E >::outgoingNeighborNodesIterator ( std::shared_ptr< N >  node) const
pure virtualinherited

◆ outgoingNeighborNodesIterator() [3/4]

std::unique_ptr<typename AssociationGraphObserver<N, E>::NodeIterator> bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::outgoingNeighborNodesIterator ( Nref  node)
inlinevirtualinherited

◆ outgoingNeighborNodesIterator() [4/4]

std::unique_ptr<typename AssociationGraphObserver<N, E>::NodeIterator> bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::outgoingNeighborNodesIterator ( Nref  node) const
inlinevirtualinherited

◆ output()

std::string ComputationTree::output ( ) const

◆ outputToDot() [1/2]

void bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::outputToDot ( const std::string &  fname,
const std::string &  name 
) const
inlineinherited

◆ outputToDot() [2/2]

◆ readFormula()

void bpp::ComputationTree::readFormula ( const std::string &  formula,
const std::map< std::string, std::shared_ptr< FunctionInterface >> &  functionNames 
)
inline

Definition at line 57 of file ComputationTree.h.

References isAllSum(), output(), and readFormula_().

◆ readFormula_()

std::shared_ptr< Operator > ComputationTree::readFormula_ ( const std::string &  formula,
const std::map< std::string, std::shared_ptr< FunctionInterface >> &  functionNames 
)
private

◆ removeSon()

template<class N, class E, class TreeGraphImpl>
void bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::removeSon ( const std::shared_ptr< N >  node,
const std::shared_ptr< N >  son 
)
inlinevirtualinherited

◆ removeSons()

template<class N, class E, class TreeGraphImpl>
std::vector<std::shared_ptr<N> > bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::removeSons ( const std::shared_ptr< N >  node)
inlinevirtualinherited

◆ rootAt()

template<class N, class E, class TreeGraphImpl>
void bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::rootAt ( const std::shared_ptr< N >  root)
inlinevirtualinherited

◆ setEdgeIndex() [1/2]

template<class N, class E>
virtual EdgeIndex bpp::AssociationGraphObserver< N, E >::setEdgeIndex ( const std::shared_ptr< E >  edgeObject,
EdgeIndex  index 
)
pure virtualinherited

Set an index associated to an edge

Parameters
edgeObjectobject to which one want to set the index
indexintex to be given, 0 to get the first free index
Returns
the given index

Implemented in bpp::AssociationGraphImplObserver< N, E, GraphImpl >, bpp::AssociationGraphImplObserver< N, E, DAGraphImpl >, and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >.

Referenced by bpp::AssociationGraphObserver< N, E >::copy().

◆ setEdgeIndex() [2/2]

EdgeIndex bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::setEdgeIndex ( const Eref  edgeObject,
EdgeIndex  index 
)
inlinevirtualinherited

Set an index associated to an edge

Parameters
edgeObjectobject to which one want to set the index
indexintex to be given, 0 to get the first free index
Returns
the given index

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 798 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::edgeToString(), and bpp::AssociationGraphImplObserver< N, E, GraphImpl >::hasEdge().

◆ setEdgeLinking() [1/2]

template<class N, class E>
virtual void bpp::AssociationGraphObserver< N, E >::setEdgeLinking ( std::shared_ptr< N >  nodeA,
std::shared_ptr< N >  nodeB,
std::shared_ptr< E >  edge 
)
pure virtualinherited

Sets the Edge between two nodes nodeA -> nodeB

Parameters
nodeAsource node (if directed)
nodeBdestination node (if directed)
edgethe edge between these two nodes

Implemented in bpp::AssociationGraphImplObserver< N, E, GraphImpl >, bpp::AssociationGraphImplObserver< N, E, DAGraphImpl >, and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >.

Referenced by bpp::AssociationGraphObserver< N, E >::EdgeIterator::~EdgeIterator().

◆ setEdgeLinking() [2/2]

void bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::setEdgeLinking ( Nref  nodeA,
Nref  nodeB,
Eref  edge 
)
inlinevirtualinherited

Sets the Edge between two nodes nodeA -> nodeB

Parameters
nodeAsource node (if directed)
nodeBdestination node (if directed)
edgethe edge between these two nodes

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 1460 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::associateEdge(), bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getEdge(), bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getGraph(), and bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getNodeGraphid().

◆ setFather()

template<class N, class E, class TreeGraphImpl>
void bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::setFather ( const std::shared_ptr< N >  nodeObject,
const std::shared_ptr< N >  fatherNodeObject,
const std::shared_ptr< E >  edgeObject = 0 
)
inlinevirtualinherited

Change / set the father of a node

Parameters
nodeObjectthe concerned node
fatherNodeObjectthe node to be the father
edgeObjectthe optional edge between the nodes (default = 00)

Implements bpp::AssociationTreeGraphObserver< N, E >.

Definition at line 272 of file AssociationTreeGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getEdgeGraphid(), bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getGraph(), and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::getNodeGraphid().

Referenced by readFormula_().

◆ setNodeIndex() [1/2]

template<class N, class E>
virtual NodeIndex bpp::AssociationGraphObserver< N, E >::setNodeIndex ( const std::shared_ptr< N >  nodeObject,
NodeIndex  index 
)
pure virtualinherited

Set an index associated to a node

Parameters
nodeObjectobject to which one want to set the index
indexintex to be given, 0 to get the first free index
Returns
the given index

Implemented in bpp::AssociationGraphImplObserver< N, E, GraphImpl >, bpp::AssociationGraphImplObserver< N, E, DAGraphImpl >, and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >.

Referenced by bpp::AssociationGraphObserver< N, E >::copy().

◆ setNodeIndex() [2/2]

NodeIndex bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::setNodeIndex ( const Nref  nodeObject,
NodeIndex  index 
)
inlinevirtualinherited

Set an index associated to a node

Parameters
nodeObjectobject to which one want to set the index
indexindex to be given
Returns
the given index

Implements bpp::AssociationGraphObserver< N, E >.

Definition at line 774 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::hasNode(), and bpp::AssociationGraphImplObserver< N, E, GraphImpl >::nodeToString().

◆ setRoot()

void bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::setRoot ( const Nref  newRoot)
inlineinherited

set the root (but no checking, to be used at first construction)

Definition at line 684 of file AssociationGraphImplObserver.h.

References bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getGraph(), and bpp::AssociationGraphImplObserver< N, E, GraphImpl >::getNodeGraphid().

Referenced by ComputationTree().

◆ sonsIterator() [1/2]

template<class N, class E, class TreeGraphImpl>
std::unique_ptr<typename AssociationTreeGraphObserver<N, E>::NodeIterator> bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::sonsIterator ( std::shared_ptr< N >  node)
inlinevirtualinherited

◆ sonsIterator() [2/2]

template<class N, class E, class TreeGraphImpl>
std::unique_ptr<typename AssociationTreeGraphObserver<N, E>::NodeIterator> bpp::AssociationTreeGraphImplObserver< N, E, TreeGraphImpl >::sonsIterator ( std::shared_ptr< N >  node) const
inlinevirtualinherited

◆ unlink() [1/2]

template<class N, class E>
virtual void bpp::AssociationGraphObserver< N, E >::unlink ( std::shared_ptr< N >  nodeObjectA,
std::shared_ptr< N >  nodeObjectB 
)
pure virtualinherited

Detroys a link between two existing nodes in the graph. If directed graph: nodeA -> nodeB.

Parameters
nodeObjectAsource node (or first node if undirected)
nodeObjectBtarget node (or second node if undirected)

Implemented in bpp::AssociationGraphImplObserver< N, E, GraphImpl >, bpp::AssociationGraphImplObserver< N, E, DAGraphImpl >, and bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >.

Referenced by bpp::AssociationGraphObserver< N, E >::copy().

◆ unlink() [2/2]

Member Data Documentation

◆ subjectGraph_

std::shared_ptr<TreeGraphImpl > bpp::AssociationGraphImplObserver< N, E, TreeGraphImpl >::subjectGraph_
protectedinherited

The observed Graph. Anytime this graph is observed, the current object will be warned to take changes into account.

Definition at line 44 of file AssociationGraphImplObserver.h.


The documentation for this class was generated from the following files: