/usr/include/tulip/GraphDecorator.h is in libtulip-dev 4.4.0dfsg2-2.
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 | /*
*
* This file is part of Tulip (www.tulip-software.org)
*
* Authors: David Auber and the Tulip development Team
* from LaBRI, University of Bordeaux 1 and Inria Bordeaux - Sud Ouest
*
* Tulip is free software; you can redistribute it and/or modify
* it under the terms of the GNU Lesser General Public License
* as published by the Free Software Foundation, either version 3
* of the License, or (at your option) any later version.
*
* Tulip is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
* See the GNU General Public License for more details.
*
*/
///@cond DOXYGEN_HIDDEN
#ifndef DOXYGEN_NOTFOR_DEVEL
#ifndef Tulip_GraphDecorator_H
#define Tulip_GraphDecorator_H
#include <tulip/Graph.h>
namespace tlp {
class TLP_SCOPE GraphDecorator : public Graph { // non-orienté, planaire
public:
GraphDecorator(Graph* s) {
assert(s);
graph_component = s;
}
virtual ~GraphDecorator() {
notifyDestroy();
}
virtual void clear();
virtual Graph *addSubGraph(BooleanProperty *selection=0,
std::string name = "unnamed");
virtual void delSubGraph(Graph * s);
virtual void delAllSubGraphs(Graph *s);
virtual Graph* getSuperGraph()const;
virtual void setSuperGraph(Graph* s);
virtual Graph* getRoot() const;
virtual Iterator<Graph *> * getSubGraphs() const;
virtual bool isSubGraph(const Graph* sg) const;
virtual bool isDescendantGraph(const Graph* sg) const;
virtual Graph* getSubGraph(unsigned int id) const;
virtual Graph* getSubGraph(const std::string &name) const;
virtual Graph* getDescendantGraph(unsigned int id) const;
virtual Graph* getDescendantGraph(const std::string &name) const;
virtual unsigned int numberOfSubGraphs() const;
virtual unsigned int numberOfDescendantGraphs() const;
//============================================================
virtual node source(const edge e)const;
virtual void setSource(const edge, const node);
virtual node target(const edge e)const;
virtual void setTarget(const edge, const node);
virtual node opposite(const edge e, const node n)const;
virtual edge existEdge(const node n, const node m, bool directed = true)const;
virtual bool hasEdge(const node source, const node target,
bool directed = true) const;
virtual std::vector<edge> getEdges(const node source, const node target,
bool directed = true) const;
virtual const std::pair<node, node>& ends(const edge e) const;
virtual void setEnds(const edge, const node, const node);
virtual void reverse(const edge e);
virtual unsigned int deg(const node n)const;
virtual unsigned int indeg(const node n)const;
virtual unsigned int outdeg(const node n)const;
virtual Graph* getNodeMetaInfo(const node n)const;
//============================================================
virtual node getOneNode() const;
virtual node getInNode(const node n,unsigned int i)const;
virtual node getOutNode(const node n,unsigned int i) const;
virtual edge getOneEdge() const;
virtual unsigned int numberOfNodes()const;
virtual unsigned int numberOfEdges()const;
//=========================================================================
virtual void reserveNodes(unsigned int nbNodes);
virtual void reserveEdges(unsigned int nbEdges);
//============================================================
virtual bool isElement(const node n) const;
virtual bool isMetaNode(const node n) const;
virtual bool isElement(const edge e) const;
virtual bool isMetaEdge(const edge e) const;
virtual node addNode();
virtual void addNodes(unsigned int nb, std::vector<node>& addedNodes);
virtual void addNode(const node);
virtual void addNodes(Iterator<node>* nodes);
virtual edge addEdge(const node n1, const node n2);
virtual void addEdges(const std::vector<std::pair<node, node> >& edges,
std::vector<edge>& addedEdges);
virtual void addEdge(const edge);
virtual void addEdges(Iterator<edge>* edges);
virtual void delNode(const tlp::node n, bool deleteInAllGraphs = false);
virtual void delNodes(Iterator<node>* itN, bool deleteInAllGraphs);
virtual void delEdge(const tlp::edge e, bool deleteInAllGraphs = false);
virtual void delEdges(Iterator<edge>* itE, bool deleteInAllGraphs = false);
virtual void setEdgeOrder(const node n,const std::vector<edge> & s);
virtual void swapEdgeOrder(const node n ,const edge e1, const edge e2);
virtual Iterator<node>* getNodes() const;
virtual Iterator<node>* getInNodes(const node n) const;
virtual Iterator<node>* getOutNodes(const node n) const;
virtual Iterator<node>* getInOutNodes(const node n) const;
virtual Iterator<node>* bfs(const node root = node()) const;
virtual Iterator<node>* dfs(const node root = node()) const;
virtual Iterator<edge>* getEdges() const;
virtual Iterator<edge>* getOutEdges(const node n) const;
virtual Iterator<edge>* getInOutEdges(const node n) const;
virtual Iterator<edge>* getInEdges(const node n) const;
virtual Iterator<edge>* getEdgeMetaInfo(const edge) const;
//============================================================
virtual PropertyInterface* getProperty(const std::string &name) const;
virtual bool existProperty(const std::string&name) const;
virtual bool existLocalProperty(const std::string&name) const;
virtual void delLocalProperty(const std::string&name);
virtual void addLocalProperty(const std::string &name, PropertyInterface *prop);
virtual Iterator<std::string>* getLocalProperties() const;
virtual Iterator<std::string>* getInheritedProperties() const;
virtual Iterator<std::string>* getProperties() const;
virtual Iterator<PropertyInterface*>* getLocalObjectProperties() const;
virtual Iterator<PropertyInterface*>* getInheritedObjectProperties() const;
virtual Iterator<PropertyInterface*>* getObjectProperties() const;
// updates management
virtual void push(bool unpopAllowed = true,
std::vector<PropertyInterface*>* propertiesToPreserveOnPop= NULL);
virtual void pop(bool unpopAllowed = true);
virtual void unpop();
virtual bool canPop();
virtual bool canUnpop();
virtual bool canPopThenUnpop();
//============================================================
virtual void setName(const std::string &name);
virtual std::string getName() const;
protected:
virtual DataSet & getNonConstAttributes();
Graph* graph_component;
// designed to reassign an id to a previously deleted elt
// called by GraphUpdatesRecorder
virtual node restoreNode(node);
virtual edge restoreEdge(edge, node source, node target);
virtual void restoreNodes(const std::vector<node>&);
virtual void restoreEdges(const std::vector<edge>& edges,
const std::vector<std::pair<node, node> >& ends);
// designed to only update own structures
// used by GraphUpdatesRecorder
virtual void removeNode(const node);
virtual void removeEdge(const edge);
// internally used to deal with sub graph deletion
virtual void removeSubGraph(Graph*);
virtual void clearSubGraphs();
virtual void restoreSubGraph(Graph*);
virtual void setSubGraphToKeep(Graph*);
// internally used for property renaming
virtual bool renameLocalProperty(PropertyInterface* prop,
const std::string& newName);
};
}
#endif
#endif //DOXYGEN_NOTFOR_DEVEL
///@endcond
|