/usr/include/Bpp/Graph/AssociationDAGraphImplObserver.h is in libbpp-core-dev 2.4.0-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 | //
// File AssociationDAGraphImplObserver.h
// Created by: Laurent Guéguen
// Last modification : lundi 19 décembre 2016, à 22h 14
//
/*
Copyright or © or Copr. Bio++ Development Team, (November 17, 2004)
This software is a computer program whose purpose is to provide utilitary
classes. This file belongs to the Bio++ Project.
This software is governed by the CeCILL license under French law and
abiding by the rules of distribution of free software. You can use,
modify and/ or redistribute the software under the terms of the CeCILL
license as circulated by CEA, CNRS and INRIA at the following URL
"http://www.cecill.info".
As a counterpart to the access to the source code and rights to copy,
modify and redistribute granted by the license, users are provided only
with a limited warranty and the software's author, the holder of the
economic rights, and the successive licensors have only limited
liability.
In this respect, the user's attention is drawn to the risks associated
with loading, using, modifying and/or developing or reproducing the
software by the user in light of its specific status of free software,
that may mean that it is complicated to manipulate, and that also
therefore means that it is reserved for developers and experienced
professionals having in-depth computer knowledge. Users are therefore
encouraged to load and test the software's suitability as regards their
requirements in conditions enabling the security of their systems and/or
data to be ensured and, more generally, to use and operate it in the
same conditions as regards security.
The fact that you are presently reading this means that you have had
knowledge of the CeCILL license and that you accept its terms.
*/
#ifndef _ASSOCIATION_DAGRAPH_IMPL_OBSERVER_HPP_
#define _ASSOCIATION_DAGRAPH_IMPL_OBSERVER_HPP_
#include "DAGraphImpl.h"
#include "AssociationDAGraphObserver.h"
#include "AssociationGraphImplObserver.h"
#include <vector>
#include <map>
#include <iostream>
#include <ostream>
#include <memory>
namespace bpp
{
template<class N, class E, class DAGraphImpl>
class AssociationDAGraphImplObserver :
public AssociationDAGraphObserver<N, E>,
public AssociationGraphImplObserver<N, E, DAGraphImpl>
{
public:
typedef typename AssociationGraphObserver<N, E>::NodeIndex NodeIndex;
typedef typename AssociationGraphObserver<N, E>::EdgeIndex EdgeIndex;
typedef typename Graph::NodeId NodeGraphid;
typedef typename Graph::EdgeId EdgeGraphid;
public:
/**
* Constructor
*/
AssociationDAGraphImplObserver() :
AssociationGraphImplObserver<N, E, DAGraphImpl>(true)
{}
/**
* Constructor
* @param subjectDAGraph the DAGraph which is observed
*/
AssociationDAGraphImplObserver(std::shared_ptr<DAGraphImpl> subjectDAGraph) :
AssociationGraphImplObserver<N, E, DAGraphImpl>(subjectDAGraph)
{}
/**
* Copy Constructor
* @param dAGraphObserver the DAGraphObserver to be copied
*/
AssociationDAGraphImplObserver(bpp::AssociationDAGraphImplObserver<N, E, DAGraphImpl> const& dAGraphObserver) :
AssociationGraphImplObserver<N, E, DAGraphImpl>(dAGraphObserver)
{}
/**
* Copy Constructor
* @param dAGraphObserver the DAGraphObserver to be copied
*/
template<class N2, class E2>
AssociationDAGraphImplObserver(bpp::AssociationDAGraphImplObserver<N2, E2, DAGraphImpl> const& dAGraphObserver) :
AssociationGraphImplObserver<N, E, DAGraphImpl>(dAGraphObserver)
{}
/**
* = Operator
* @param dAGraphObserver the DAGraphObserver we want to copy the values
*/
AssociationDAGraphImplObserver<N, E, DAGraphImpl>& operator=(bpp::AssociationDAGraphImplObserver<N, E, DAGraphImpl> const& dAGraphObserver)
{
AssociationGraphImplObserver<N, E, DAGraphImpl>::operator=(dAGraphObserver);
return *this;
}
/**
* Destructor
*/
~AssociationDAGraphImplObserver()
{}
/**
* clone function
*/
AssociationDAGraphImplObserver<N, E, DAGraphImpl>* clone() const
{
return new AssociationDAGraphImplObserver<N, E, DAGraphImpl>(*this);
}
/**
* Is the graph a DAG? A DAG must be acyclic and with no isolated node.
* @return true if valid DAG
*/
bool isValid() const
{
return this->getGraph()->isValid();
}
/**
* Is the DAG rooted? Ie with a unique node with no father.
* @return true if rooted
*/
bool isRooted() const
{
return this->getGraph()->isRooted();
}
/**
* Return the fathers of a node
* @param node the concerned node
* @return a vector of son Nodes
*/
std::vector<std::shared_ptr<N> > getFathers(const std::shared_ptr<N> node) const
{
return this->getNodesFromGraphid(this->getGraph()->getFathers(this->getNodeGraphid(node)));
}
std::vector<NodeIndex> getFathers(const NodeIndex node) const
{
return this->getNodeIndexes(this->getNodesFromGraphid(this->getGraph()->getFathers(this->getNodeGraphid(this->getNode(node)))));
}
/**
* @brief Sets the root and make the DAG directed from root to
* leaves
*
*/
void rootAt(const std::shared_ptr<N> root)
{
this->getGraph()->rootAt(this->getNodeGraphid(root));
}
/**
* Has the node a father?
*/
bool hasFather(const std::shared_ptr<N> nodeObject) const
{
return this->getGraph()->hasFather(this->getNodeGraphid(nodeObject));
}
bool hasFather(const NodeIndex node) const
{
return this->getGraph()->hasFather(this->getNodeGraphid(this->getNode(node)));
}
/**
* Return the sons of a node
* @return a vector of son Nodes
*/
std::vector<std::shared_ptr<N> > getSons(const std::shared_ptr<N> node) const
{
return this->getNodesFromGraphid(this->getGraph()->getSons(this->getNodeGraphid(node)));
}
std::vector<NodeIndex> getSons(const NodeIndex node) const
{
return this->getNodeIndexes(this->getNodesFromGraphid(this->getGraph()->getSons(this->getNodeGraphid(this->getNode(node)))));
}
/**
* Return the son of an edge
* @param edge the concerned edge
* @return the son Node
*/
std::shared_ptr<N> getSon(const std::shared_ptr<E> edge) const
{
return this->getNodeFromGraphid(this->getGraph()->getBottom(this->getEdgeGraphid(edge)));
}
NodeIndex getSon(const EdgeIndex edgeId) const
{
return this->getNodeIndex(this->getNodeFromGraphid(this->getGraph()->getBottom(this->getEdgeGraphid(this->getEdge(edgeId)))));
}
/**
* Return the father of an edge
* @param edge the concerned edge
* @return the father Node
*/
std::shared_ptr<N> getFather(const std::shared_ptr<E> edge) const
{
return this->getNodeFromGraphid(this->getGraph()->getTop(this->getEdgeGraphid(edge)));
}
NodeIndex getFather(const EdgeIndex edge) const
{
return this->getNodeIndex(this->getNodeFromGraphid(this->getGraph()->getTop(this->getEdgeGraphid(this->getEdge(edge)))));
}
/**
* Return the number of fathers
* @param node the concerned node
* @return the number of fathers
*/
size_t getNumberOfFathers(const std::shared_ptr<N> node) const
{
return this->getGraph()->getNumberOfFathers(this->getNodeGraphid(node));
}
/**
* Return the number of sons
* @param node the concerned node
* @return the number of sons
*/
size_t getNumberOfSons(const std::shared_ptr<N> node) const
{
return this->getGraph()->getNumberOfSons(this->getNodeGraphid(node));
}
/**
* Get the leaves of a DAG under a peculiar node.
*
* @param node the starting node
* @return a vector containing the leaves
*/
std::vector<std::shared_ptr<N> > getLeavesUnderNode(std::shared_ptr<N> node) const
{
return this->getNodesFromGraphid(this->getGraph()->getLeavesUnderNode(this->getNodeGraphid(node)));
}
/**
* Remove the fathers of a node
* @return a vector containing the removed fathers
*/
std::vector<std::shared_ptr<N> > removeFathers(const std::shared_ptr<N> node)
{
return this->getNodesFromGraphid(this->getGraph()->removeFathers(this->getNodeGraphid(node)));
}
/**
* Remove a father of a node
* @return a vector containing the removed nodes
*/
void removeFather(const std::shared_ptr<N> node, const std::shared_ptr<N> father)
{
this->getGraph()->removeFather(this->getNodeGraphid(node), this->getNodeGraphid(father));
}
/**
* Remove the sons of a node
* @return a vector containing the removed nodes
*/
std::vector<std::shared_ptr<N> > removeSons(const std::shared_ptr<N> node)
{
return this->getNodesFromGraphid(this->getGraph()->removeSons(this->getNodeGraphid(node)));
}
/**
* Remove a son of a node
*/
void removeSon(const std::shared_ptr<N> node, const std::shared_ptr<N> son)
{
this->getGraph()->removeSon(this->getNodeGraphid(node), this->getNodeGraphid(son));
}
/**
* Add a father to a node
* @param nodeObject the concerned node
* @param fatherNodeObject the node to be added as a father to the node
* @param edgeObject the optional edge between the nodes (default
* = 00)
*/
void addFather(const std::shared_ptr<N> nodeObject, const std::shared_ptr<N> fatherNodeObject, const std::shared_ptr<E> edgeObject = 0)
{
if (edgeObject)
try
{
this->getGraph()->addFather(this->getNodeGraphid(nodeObject), this->getNodeGraphid(fatherNodeObject), this->getEdgeGraphid(edgeObject));
}
catch (Exception& e)
{
this->link(fatherNodeObject, nodeObject, edgeObject);
}
else
this->getGraph()->addFather(this->getNodeGraphid(nodeObject), this->getNodeGraphid(fatherNodeObject));
}
/**
* Add a son to a node
* @param nodeObject the concerned node
* @param sonNodeObject the node to be added as a son to the father
* @param edgeObject the optional edge between the nodes (default
* = 00)
*/
void addSon(const std::shared_ptr<N> nodeObject, const std::shared_ptr<N> sonNodeObject, const std::shared_ptr<E> edgeObject = 0)
{
if (edgeObject)
try
{
this->getGraph()->addSon(this->getNodeGraphid(nodeObject), this->getNodeGraphid(sonNodeObject), this->getEdgeGraphid(edgeObject));
}
catch (Exception& e)
{
this->link(nodeObject, sonNodeObject, edgeObject);
}
else
this->getGraph()->addSon(this->getNodeGraphid(nodeObject), this->getNodeGraphid(sonNodeObject));
}
/**
* Iterators
*
*/
/*
* @brief builds iterator on the fathers of a Node
*
*/
std::unique_ptr<typename AssociationDAGraphObserver<N, E>::NodeIterator> fathersIterator(std::shared_ptr<N> node)
{
return this->incomingNeighborNodesIterator(node);
}
std::unique_ptr<typename AssociationDAGraphObserver<N, E>::NodeIterator> fathersIterator(std::shared_ptr<N> node) const
{
return this->incomingNeighborNodesIterator(node);
}
/*
* @brief builds iterator on the sons of a Node
*
*/
std::unique_ptr<typename AssociationDAGraphObserver<N, E>::NodeIterator> sonsIterator(std::shared_ptr<N> node)
{
return this->outgoingNeighborNodesIterator(node);
}
std::unique_ptr<typename AssociationDAGraphObserver<N, E>::NodeIterator> sonsIterator(std::shared_ptr<N> node) const
{
return this->outgoingNeighborNodesIterator(node);
}
/**
* @brief Get Below Objects.
*
* @param localRoot of the subgraph.
* @return A vector of ancestor nodes ids.
*
*/
std::vector<std::shared_ptr<N> > getBelowNodes(const std::shared_ptr<N> localRoot)
{
return this->getNodesFromGraphid(this->getGraph()->getBelowNodes(this->getNodeGraphid(localRoot)));
}
std::vector<std::shared_ptr<E> > getBelowEdges(const std::shared_ptr<N> localRoot)
{
return AssociationGraphImplObserver<N, E, DAGraphImpl>::getEdgesFromGraphid(this->getGraph()->getBelowEdges(this->getNodeGraphid(localRoot)));
}
};
/********************/
template<class N, class E>
using AssociationDAGlobalGraphObserver = AssociationDAGraphImplObserver<N, E, DAGlobalGraph>;
/********************/
}
#endif
|