bpp::DAGraphImpl< GraphImpl > Member List

This is the complete list of members for bpp::DAGraphImpl< GraphImpl >, including all inherited members.

addFather(Graph::NodeId node, Graph::NodeId father)	bpp::DAGraphImpl< GraphImpl >	virtual
addFather(Graph::NodeId node, Graph::NodeId father, Graph::EdgeId edgeId)	bpp::DAGraphImpl< GraphImpl >	virtual
addSon(Graph::NodeId node, Graph::NodeId sonNode)	bpp::DAGraphImpl< GraphImpl >
addSon(Graph::NodeId node, Graph::NodeId sonNode, Graph::EdgeId edge)	bpp::DAGraphImpl< GraphImpl >
allEdgesIterator()=0	bpp::Graph	pure virtual
allNodesIterator()=0	bpp::Graph	pure virtual
allNodesIterator() const =0	bpp::Graph	pure 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
DAGraphImpl(bool b=true)	bpp::DAGraphImpl< GraphImpl >
deleteNode(NodeId node)=0	bpp::Graph	pure virtual
EdgeId typedef	bpp::Graph
fillListOfLeaves_(Graph::NodeId startingNode, std::vector< Graph::NodeId > &foundLeaves) const	bpp::DAGraphImpl< GraphImpl >
fillSubtreeMetEdges_(std::vector< Graph::EdgeId > &metEdges, Graph::NodeId localRoot) const	bpp::DAGraphImpl< GraphImpl >
fillSubtreeMetNodes_(std::vector< Graph::NodeId > &metNodes, Graph::NodeId localRoot) const	bpp::DAGraphImpl< GraphImpl >
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
getBelowEdges(Graph::NodeId localRoot) const	bpp::DAGraphImpl< GraphImpl >	virtual
getBelowNodes(Graph::NodeId localRoot) const	bpp::DAGraphImpl< GraphImpl >	virtual
getBottom(EdgeId edge) const =0	bpp::Graph	pure virtual
getDegree(NodeId node) const =0	bpp::Graph	pure virtual
getEdge(NodeId nodeA, NodeId nodeB) const =0	bpp::Graph	pure virtual
getEdges(const NodeId node) const =0	bpp::Graph	pure virtual
getFathers(Graph::NodeId nodeid) const	bpp::DAGraphImpl< 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::DAGraphImpl< GraphImpl >	virtual
getNeighbors(const NodeId node) const =0	bpp::Graph	pure virtual
getNodes(EdgeId edge) const =0	bpp::Graph	pure virtual
getNumberOfEdges() const =0	bpp::Graph	pure virtual
getNumberOfFathers(Graph::NodeId node) const	bpp::DAGraphImpl< GraphImpl >	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::DAGraphImpl< 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::DAGraphImpl< GraphImpl >	virtual
getTop(EdgeId edge) const =0	bpp::Graph	pure virtual
hasFather(Graph::NodeId node) const	bpp::DAGraphImpl< 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::DAGraphImpl< GraphImpl >	virtual
isRooted() const	bpp::DAGraphImpl< GraphImpl >	virtual
isRooted_	bpp::DAGraphImpl< GraphImpl >	mutableprotected
isTree() const =0	bpp::Graph	pure virtual
isValid() const	bpp::DAGraphImpl< GraphImpl >	virtual
isValid_	bpp::DAGraphImpl< GraphImpl >	mutableprotected
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
mustBeRooted_() const	bpp::DAGraphImpl< GraphImpl >	protected
mustBeValid_() const	bpp::DAGraphImpl< GraphImpl >	protected
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
orientGraphFrom_(std::set< Graph::NodeId > &metNodes, Graph::NodeId localRoot)	bpp::DAGraphImpl< GraphImpl >	protected
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::DAGraphImpl< GraphImpl >	protected
registerObserver(GraphObserver *observer)=0	bpp::Graph	pure virtual
removeFather(Graph::NodeId node, Graph::NodeId father)	bpp::DAGraphImpl< GraphImpl >	virtual
removeFathers(Graph::NodeId node)	bpp::DAGraphImpl< GraphImpl >	virtual
removeSon(Graph::NodeId node, Graph::NodeId son)	bpp::DAGraphImpl< GraphImpl >	virtual
removeSons(Graph::NodeId node)	bpp::DAGraphImpl< GraphImpl >	virtual
rootAt(Graph::NodeId newRoot)	bpp::DAGraphImpl< GraphImpl >	virtual
setRoot(NodeId newRoot)=0	bpp::Graph	protectedpure virtual
topologyHasChanged_() const	bpp::DAGraphImpl< GraphImpl >	protectedvirtual
unlink(NodeId nodeA, NodeId nodeB)=0	bpp::Graph	protectedpure virtual
unregisterObserver(GraphObserver *observer)=0	bpp::Graph	pure virtual
validate_() const	bpp::DAGraphImpl< GraphImpl >	protected
~Graph()	bpp::Graph	inlinevirtual