- Generated on Wed Jul 3 2024 10:53:59 for bpp-core3 by
1.8.13
|
bpp-core3
3.0.0
|
This is the complete list of members for bpp::TreeGraphImpl< GraphImpl >, including all inherited members.
| addSon(Graph::NodeId node, Graph::NodeId sonNode) | bpp::TreeGraphImpl< GraphImpl > | virtual |
| addSon(Graph::NodeId node, Graph::NodeId sonNode, Graph::EdgeId edgeId) | bpp::TreeGraphImpl< GraphImpl > | virtual |
| allEdgesIterator()=0 | bpp::Graph | pure virtual |
| allNodesIterator()=0 | bpp::Graph | pure virtual |
| allNodesIterator() const =0 | bpp::Graph | pure virtual |
| branchesIterator(Graph::NodeId node) | bpp::TreeGraphImpl< GraphImpl > | virtual |
| branchesIterator(Graph::NodeId node) const | bpp::TreeGraphImpl< GraphImpl > | virtual |
| containsReciprocalRelations() const =0 | bpp::Graph | pure virtual |
| createNode()=0 | bpp::Graph | pure virtual |
| createNodeFromEdge(NodeId origin)=0 | bpp::Graph | pure virtual |
| createNodeFromNode(NodeId origin)=0 | bpp::Graph | pure virtual |
| createNodeOnEdge(NodeId edge)=0 | bpp::Graph | pure virtual |
| deleteNode(NodeId node)=0 | bpp::Graph | pure virtual |
| EdgeId typedef | bpp::Graph | |
| fillListOfLeaves_(Graph::NodeId startingNode, std::vector< Graph::NodeId > &foundLeaves) const | bpp::TreeGraphImpl< GraphImpl > | private |
| fillSubtreeMetEdges_(std::vector< Graph::EdgeId > &metEdges, Graph::NodeId localRoot) const | bpp::TreeGraphImpl< GraphImpl > | private |
| fillSubtreeMetNodes_(std::vector< Graph::NodeId > &metNodes, Graph::NodeId localRoot) const | bpp::TreeGraphImpl< GraphImpl > | private |
| getAllEdges() const =0 | bpp::Graph | pure virtual |
| getAllInnerNodes() const =0 | bpp::Graph | pure virtual |
| getAllLeaves() const =0 | bpp::Graph | pure virtual |
| getAllNodes() const =0 | bpp::Graph | pure virtual |
| getAnyEdge(NodeId nodeA, NodeId nodeB) const =0 | bpp::Graph | pure virtual |
| getBottom(EdgeId edge) const =0 | bpp::Graph | pure virtual |
| getBranches(Graph::NodeId node) const | bpp::TreeGraphImpl< GraphImpl > | virtual |
| getDegree(NodeId node) const =0 | bpp::Graph | pure virtual |
| getEdge(NodeId nodeA, NodeId nodeB) const =0 | bpp::Graph | pure virtual |
| getEdgePathBetweenTwoNodes(Graph::NodeId nodeA, Graph::NodeId nodeB) const | bpp::TreeGraphImpl< GraphImpl > | virtual |
| getEdges(const NodeId node) const =0 | bpp::Graph | pure virtual |
| getEdgeToFather(Graph::NodeId node) const | bpp::TreeGraphImpl< GraphImpl > | virtual |
| getFatherOfNode(Graph::NodeId nodeid) const | bpp::TreeGraphImpl< GraphImpl > | virtual |
| getIncomingEdges(NodeId node) const =0 | bpp::Graph | pure virtual |
| getIncomingNeighbors(NodeId node) const =0 | bpp::Graph | pure virtual |
| getLeavesFromNode(NodeId node, unsigned int maxDepth) const =0 | bpp::Graph | pure virtual |
| getLeavesUnderNode(Graph::NodeId node) const | bpp::TreeGraphImpl< GraphImpl > | virtual |
| getNeighbors(const NodeId node) const =0 | bpp::Graph | pure virtual |
| getNodePathBetweenTwoNodes(Graph::NodeId nodeA, Graph::NodeId nodeB, bool includeAncestor=true) const | bpp::TreeGraphImpl< GraphImpl > | virtual |
| getNodes(EdgeId edge) const =0 | bpp::Graph | pure virtual |
| getNumberOfEdges() const =0 | bpp::Graph | pure virtual |
| getNumberOfIncomingNeighbors(const NodeId node) const =0 | bpp::Graph | pure virtual |
| getNumberOfNeighbors(NodeId node) const =0 | bpp::Graph | pure virtual |
| getNumberOfNodes() const =0 | bpp::Graph | pure virtual |
| getNumberOfOutgoingNeighbors(NodeId node) const =0 | bpp::Graph | pure virtual |
| getNumberOfSons(Graph::NodeId node) const | bpp::TreeGraphImpl< GraphImpl > | virtual |
| getOutgoingEdges(const NodeId node) const =0 | bpp::Graph | pure virtual |
| getOutgoingNeighbors(const NodeId node) const =0 | bpp::Graph | pure virtual |
| getRoot() const =0 | bpp::Graph | pure virtual |
| getSetOfAllLeaves() const =0 | bpp::Graph | pure virtual |
| getSons(Graph::NodeId node) const | bpp::TreeGraphImpl< GraphImpl > | virtual |
| getSubtreeEdges(Graph::NodeId localRoot) const | bpp::TreeGraphImpl< GraphImpl > | virtual |
| getSubtreeNodes(Graph::NodeId localRoot) const | bpp::TreeGraphImpl< GraphImpl > | virtual |
| getTop(EdgeId edge) const =0 | bpp::Graph | pure virtual |
| hasFather(Graph::NodeId node) const | bpp::TreeGraphImpl< GraphImpl > | virtual |
| incomingEdgesIterator(NodeId node)=0 | bpp::Graph | pure virtual |
| incomingNeighborNodesIterator(NodeId node)=0 | bpp::Graph | pure virtual |
| isDA() const =0 | bpp::Graph | pure virtual |
| isDirected() const =0 | bpp::Graph | pure virtual |
| isLeaf(Graph::NodeId node) const | bpp::TreeGraphImpl< GraphImpl > | virtual |
| isRooted() const | bpp::TreeGraphImpl< GraphImpl > | |
| isTree() const =0 | bpp::Graph | pure virtual |
| isValid() const | bpp::TreeGraphImpl< GraphImpl > | virtual |
| isValid_ | bpp::TreeGraphImpl< GraphImpl > | mutableprivate |
| link(NodeId nodeA, NodeId nodeB)=0 | bpp::Graph | protectedpure virtual |
| link(Graph::NodeId nodeA, Graph::NodeId nodeB, Graph::EdgeId edgeID)=0 | bpp::Graph | protectedpure virtual |
| makeDirected()=0 | bpp::Graph | pure virtual |
| makeUndirected()=0 | bpp::Graph | pure virtual |
| MRCA(const std::vector< Graph::NodeId > &nodes) const | bpp::TreeGraphImpl< GraphImpl > | virtual |
| mustBeRooted_() const | bpp::TreeGraphImpl< GraphImpl > | private |
| mustBeValid_() const | bpp::TreeGraphImpl< GraphImpl > | private |
| NodeId typedef | bpp::Graph | |
| notifyDeletedEdges(const std::vector< EdgeId > &edgesToDelete) const =0 | bpp::Graph | protectedpure virtual |
| notifyDeletedNodes(const std::vector< NodeId > &nodesToDelete) const =0 | bpp::Graph | protectedpure virtual |
| orientate()=0 | bpp::Graph | pure virtual |
| outgoingEdgesIterator(NodeId node)=0 | bpp::Graph | pure virtual |
| outgoingNeighborNodesIterator(NodeId node)=0 | bpp::Graph | pure virtual |
| outputToDot(std::ostream &out, const std::string &name) const =0 | bpp::Graph | pure virtual |
| propagateDirection_(Graph::NodeId node) | bpp::TreeGraphImpl< GraphImpl > | private |
| registerObserver(GraphObserver *observer)=0 | bpp::Graph | pure virtual |
| removeSon(Graph::NodeId node, Graph::NodeId son) | bpp::TreeGraphImpl< GraphImpl > | virtual |
| removeSons(Graph::NodeId node) | bpp::TreeGraphImpl< GraphImpl > | |
| rootAt(Graph::NodeId newRoot) | bpp::TreeGraphImpl< GraphImpl > | virtual |
| setFather(Graph::NodeId node, Graph::NodeId fatherNode) | bpp::TreeGraphImpl< GraphImpl > | virtual |
| setFather(Graph::NodeId node, Graph::NodeId fatherNode, Graph::EdgeId edgeId) | bpp::TreeGraphImpl< GraphImpl > | virtual |
| setOutGroup(Graph::NodeId newOutGroup) | bpp::TreeGraphImpl< GraphImpl > | virtual |
| setRoot(NodeId newRoot)=0 | bpp::Graph | protectedpure virtual |
| sonsIterator(Graph::NodeId node) | bpp::TreeGraphImpl< GraphImpl > | virtual |
| sonsIterator(Graph::NodeId node) const | bpp::TreeGraphImpl< GraphImpl > | virtual |
| topologyHasChanged_() const | bpp::TreeGraphImpl< GraphImpl > | private |
| TreeGraphImpl() | bpp::TreeGraphImpl< GraphImpl > | |
| TreeGraphImpl(bool rooted=true) | bpp::TreeGraphImpl< GraphImpl > | |
| unlink(NodeId nodeA, NodeId nodeB)=0 | bpp::Graph | protectedpure virtual |
| unregisterObserver(GraphObserver *observer)=0 | bpp::Graph | pure virtual |
| unRoot(bool joinRootSons) | bpp::TreeGraphImpl< GraphImpl > | virtual |
| validate_() const | bpp::TreeGraphImpl< GraphImpl > | private |
| ~Graph() | bpp::Graph | inlinevirtual |
1.8.13