Open
Graph Drawing
Framework

 v. 2022.02 (Dogwood)
 

ogdf::PlanRepInc Class Reference

This class is only an adaption of PlanRep for the special incremental drawing case. More...

#include <ogdf/planarity/PlanRepInc.h>

+ Inheritance diagram for ogdf::PlanRepInc:

Public Member Functions

 PlanRepInc (const UMLGraph &UG)
 Constructor for interactive updates (parts added step by step) More...
 
 PlanRepInc (const UMLGraph &UG, const NodeArray< bool > &fixed)
 Constructor for incremental updates (whole graph already given). The part to stay fixed has fixed value set to true. More...
 
void activateEdge (edge e)
 Sets activity status to true and updates the structures. More...
 
void activateNode (node v)
 Sets activity status to true and updates the structures. Node activation activates all adjacent edges. More...
 
int & componentNumber (node v)
 Component number. More...
 
adjEntry getExtAdj (GraphCopy &GC, CombinatorialEmbedding &E)
 
void getExtAdjs (List< adjEntry > &extAdjs)
 Sets a list of adjentries on "external" faces of unconnected active parts of the current CC. More...
 
void initActiveCC (int i)
 Inits a CC only with active elements. More...
 
node initMinActiveCC (int i)
 Inits a CC with at least one active node, makes a node active if necessary and returns it. Returns nullptr otherwise. More...
 
bool makeTreeConnected (adjEntry adjExternal)
 Handles copies of original CCs that are split into unconnected parts of active nodes by connecting them tree-like, adding necessary edges at "external" nodes of the partial CCs. Note that this only makes sense when the CC parts are already correctly embedded. More...
 
bool & treeEdge (edge e)
 
edge treeEdge (int i, int j) const
 
bool treeInit ()
 
virtual void nodeDeleted (node v) override
 In the case that the underlying incremental structure changes, we update this copy. More...
 
virtual void nodeAdded (node v) override
 Called by watched graph when a node is added Has to be implemented by derived classes. More...
 
virtual void edgeDeleted (edge e) override
 Called by watched graph when an edge is deleted Has to be implemented by derived classes. More...
 
virtual void edgeAdded (edge e) override
 Called by watched graph when an edge is added Has to be implemented by derived classes. More...
 
virtual void reInit () override
 Called by watched graph when it is reinitialized Has to be implemented by derived classes. More...
 
virtual void cleared () override
 Called by watched graph when its clear function is called Has to be implemented by derived classes. More...
 
void deleteTreeConnection (int i, int j)
 Deletes an edge again. More...
 
void deleteTreeConnection (int i, int j, CombinatorialEmbedding &E)
 
Extension of methods defined by GraphCopy/PlanRep
virtual edge split (edge e) override
 Splits edge e, can be removed when edge status in edgetype m_treedge can be removed afterwards. More...
 
- Public Member Functions inherited from ogdf::PlanRepUML
 ~PlanRepUML ()
 Deconstruction. More...
 
bool faceSplitter (edge e) const
 Returns true if an edge splits a face into two subfaces to guarantee generalizations to be on opposite sides of a node. More...
 
const UMLGraphgetUMLGraph () const
 
void initCC (int i)
 
void removeFaceSplitter ()
 Removes all face splitting edges. More...
 
 PlanRepUML (const UMLGraph &umlGraph)
 Construction. More...
 
 PlanRepUML (const GraphAttributes &GA)
 
void setupIncremental (int indexCC, CombinatorialEmbedding &E)
 Initializes incremental stuff, e.g. insert incremental mergers. More...
 
const SList< node > & incrementalMergers (int indexCC) const
 Returns the list of inserted incremental mergers. More...
 
bool alignUpward (adjEntry ae)
 
void alignUpward (adjEntry ae, bool b)
 
node insertGenMerger (node v, const SList< edge > &inGens, CombinatorialEmbedding &E)
 Inserts a generalization merge node for all incoming generalizations of v and returns its conserving embedding. More...
 
void expand (bool lowDegreeExpand=false) override
 Expands nodes with degree > 4 and merge nodes for generalizations. More...
 
void expandLowDegreeVertices (OrthoRep &OR, bool alignSmallDegree=false)
 Expands nodes with degree <= 4 and aligns opposite edges at degree 2 nodes. More...
 
void collapseVertices (const OrthoRep &OR, Layout &drawing)
 
void writeGML (const char *fileName, const Layout &drawing)
 Writes attributed graph in GML format to file fileName (for debugging only) More...
 
void writeGML (const char *fileName)
 
void writeGML (const char *fileName, GraphAttributes &AG)
 
void writeGML (std::ostream &os, const Layout &drawing)
 Writes attributed graph in GML format to output stream os (for debugging only) More...
 
void writeGML (const char *fileName, const OrthoRep &OR, const Layout &drawing)
 
void writeGML (std::ostream &os, const OrthoRep &OR, const Layout &drawing)
 
void writeGML (const char *fileName, const OrthoRep &OR, const GridLayoutMapped &drawing)
 
void writeGML (std::ostream &os, const OrthoRep &OR, const GridLayoutMapped &drawing)
 
- Public Member Functions inherited from ogdf::PlanRep
 PlanRep (const Graph &G)
 Creates a planarized representation of graph G. More...
 
 PlanRep (const GraphAttributes &AG)
 Creates a planarized representation of graph AG. More...
 
virtual ~PlanRep ()
 
int numberOfCCs () const
 Returns the number of connected components in the original graph. More...
 
int currentCC () const
 Returns the index of the current connected component (-1 if not yet initialized). More...
 
const CCsInfoccInfo () const
 Returns the connected components info structure. More...
 
int numberOfNodesInCC () const
 Returns the number of nodes in the current connected component. More...
 
int numberOfNodesInCC (int cc) const
 Returns the number of nodes in connected component cc. More...
 
node v (int i) const
 Returns node i in the list of all original nodes. More...
 
edge e (int i) const
 Returns edge i in the list of all original edges. More...
 
int startNode () const
 Returns the index of the first node in this connected component. More...
 
int startNode (int cc) const
 Returns the index of the first node in connected component cc. More...
 
int stopNode () const
 Returns the index of (one past) the last node in this connected component. More...
 
int stopNode (int cc) const
 Returns the index of (one past) the last node in connected component cc. More...
 
int startEdge () const
 Returns the index of the first edge in this connected component. More...
 
int stopEdge () const
 Returns the index of (one past) the last edge in this connected component. More...
 
void initCC (int cc)
 Initializes the planarized representation for connected component cc. More...
 
adjEntry expandAdj (node v) const
 Returns the adjacency entry of a node of an expanded face. More...
 
adjEntryexpandAdj (node v)
 
adjEntry boundaryAdj (node v) const
 Returns the adjacency entry of the first edge of the inserted boundary at a center node (original) of a clique, 0 if no boundary exists. More...
 
adjEntryboundaryAdj (node v)
 Returns a reference to the adjacency entry of the first edge of the inserted boundary at a center node (original) of a clique, 0 if no boundary exists. More...
 
void setCliqueBoundary (edge e)
 
bool isCliqueBoundary (edge e) const
 
Graph::NodeType typeOf (node v) const
 Returns the type of node v. More...
 
Graph::NodeTypetypeOf (node v)
 Returns a reference to the type of node v. More...
 
bool isVertex (node v) const
 Returns true if the node represents a "real" object in the original graph. More...
 
nodeType nodeTypeOf (node v)
 Returns the extended node type of v. More...
 
void setCrossingType (node v)
 Classifies node v as a crossing. More...
 
bool isCrossingType (node v) const
 Returns true iff node v is classified as a crossing. More...
 
EdgeType typeOf (edge e) const
 Returns the type of edge e. More...
 
EdgeTypetypeOf (edge e)
 Returns a reference to the type of edge e. More...
 
edgeTypeoriEdgeTypes (edge e)
 Returns a reference to the type of original edge e. More...
 
edgeType edgeTypeOf (edge e) const
 Returns the new type field of e. More...
 
edgeTypeedgeTypes (edge e)
 Returns a reference to the new type field of e. More...
 
void setEdgeTypeOf (edge e, edgeType et)
 Sets the new type field of edge e to et. More...
 
void setType (edge e, EdgeType et)
 Set both type values of e at once. More...
 
bool isGeneralization (edge e) const
 Returns true iff edge e is classified as generalization. More...
 
void setGeneralization (edge e)
 Classifies edge e as generalization (primary type). More...
 
bool isDependency (edge e) const
 Returns true iff edge e is classified as dependency. More...
 
void setDependency (edge e)
 Classifies edge e as dependency (primary type). More...
 
void setAssociation (edge e)
 Classifies edge e as association (primary type). More...
 
void setExpansion (edge e)
 Classifies edge e as expansion edge (secondary type). More...
 
bool isExpansion (edge e) const
 Returns true iff edge e is classified as expansion edge. More...
 
bool isBoundary (edge e) const
 Returns true iff edge e is a clique boundary. More...
 
void setAssClass (edge e)
 Classifies edge e as connection at an association class (tertiary type). More...
 
bool isAssClass (edge e) const
 Returns true iff edge e is classified as connection at an association class. More...
 
void setBrother (edge e)
 Classifies edge e as connection between hierarchy neighbours (fourth level type). More...
 
void setHalfBrother (edge e)
 Classifies edge e as connection between ... (fourth level type). More...
 
bool isBrother (edge e) const
 Returns true if edge e is classified as brother. More...
 
bool isHalfBrother (edge e) const
 Returns true if edge e is classified as half-brother. More...
 
edgeType edgeTypeAND (edge e, edgeType et)
 Sets type of edge e to current type (bitwise) AND et. More...
 
edgeType edgeTypeOR (edge e, edgeType et)
 Sets type of edge e to current type (bitwise) OR et. More...
 
void setPrimaryType (edge e, edgeType et)
 Sets primary edge type of edge e to primary edge type in et (deletes old primary value). More...
 
void setPrimaryType (edge e, UMLEdgeTypeConstants et)
 Sets primary edge type of edge e to primary edge type in et (deletes old primary value). More...
 
void setSecondaryType (edge e, edgeType et)
 Sets secondary edge type of edge e to primary edge type in et. More...
 
edgeType edgeTypePrimaryAND (edge e, edgeType et)
 Sets primary type of e to bitwise AND of et's primary value and old value. More...
 
edgeType edgeTypePrimaryOR (edge e, edgeType et)
 Sets primary type of e to bitwise OR of et's primary value and old value. More...
 
void setUserType (edge e, edgeType et)
 Sets user defined type locally. More...
 
bool isUserType (edge e, edgeType et) const
 Returns user defined type. More...
 
void setExpansionEdge (edge e, int expType)
 Sets the expansion edge type of e to expType. More...
 
bool isExpansionEdge (edge e) const
 Returns if e is an expansion edge. More...
 
int expansionType (edge e) const
 Returns the expansion edge type of e. More...
 
bool isDegreeExpansionEdge (edge e) const
 Returns if e is a degree expansion edge. More...
 
const NodeArray< double > & widthOrig () const
 Gives access to the node array of the widths of original nodes. More...
 
double widthOrig (node v) const
 Returns the width of original node v. More...
 
const NodeArray< double > & heightOrig () const
 Gives access to the node array of the heights of original nodes. More...
 
double heightOrig (node v) const
 Returns the height of original node v. More...
 
EdgeType typeOrig (edge e) const
 Returns the type of original edge e. More...
 
const GraphAttributesgetGraphAttributes () const
 Returns the graph attributes of the original graph (the pointer may be 0). More...
 
void expandLowDegreeVertices (OrthoRep &OR)
 
void collapseVertices (const OrthoRep &OR, Layout &drawing)
 
void collapseVertices (const OrthoRep &OR, GridLayout &drawing)
 
void removeCrossing (node v)
 
void insertBoundary (node center, adjEntry &adjExternal)
 
node expandedNode (node v) const
 
void setExpandedNode (node v, node w)
 
node newCopy (node vOrig, Graph::NodeType vType)
 Creates a new node with node type vType in the planarized representation. More...
 
edge newCopy (node v, adjEntry adjAfter, edge eOrig)
 Creates a new edge in the planarized representation. More...
 
edge newCopy (node v, adjEntry adjAfter, edge eOrig, CombinatorialEmbedding &E)
 Creates a new edge in the planarized representation while updating the embedding E. More...
 
void insertEdgePath (edge eOrig, const SList< adjEntry > &crossedEdges)
 Re-inserts edge eOrig by "crossing" the edges in crossedEdges. More...
 
void insertEdgePathEmbedded (edge eOrig, CombinatorialEmbedding &E, const SList< adjEntry > &crossedEdges)
 Same as insertEdgePath, but for embedded graphs. More...
 
void removeEdgePathEmbedded (CombinatorialEmbedding &E, edge eOrig, FaceSet< false > &newFaces)
 Removes the complete edge path for edge eOrig while preserving the embedding. More...
 
edge insertCrossing (edge &crossingEdge, edge crossedEdge, bool topDown)
 Inserts crossings between two copy edges. More...
 
void removeDeg1Nodes (ArrayBuffer< Deg1RestoreInfo > &S, const NodeArray< bool > &mark)
 Removes all marked degree-1 nodes from the graph copy and stores restore information in S. More...
 
void restoreDeg1Nodes (ArrayBuffer< Deg1RestoreInfo > &S, List< node > &deg1s)
 Restores degree-1 nodes previously removed with removeDeg1Nodes(). More...
 
void writeGML (const char *fileName, const OrthoRep &OR, const GridLayout &drawing)
 
void writeGML (std::ostream &os, const OrthoRep &OR, const GridLayout &drawing)
 
- Public Member Functions inherited from ogdf::GraphCopy
 GraphCopy ()
 Default constructor (does nothing!). More...
 
 GraphCopy (const Graph &G)
 Creates a graph copy of G. More...
 
 GraphCopy (const GraphCopy &GC)
 Copy constructor. More...
 
virtual ~GraphCopy ()
 
const Graphoriginal () const
 Returns a reference to the original graph. More...
 
node original (node v) const
 Returns the node in the original graph corresponding to v. More...
 
edge original (edge e) const
 Returns the edge in the original graph corresponding to e. More...
 
adjEntry original (adjEntry adj) const
 Returns the adjacency entry in the original graph corresponding to adj. More...
 
node copy (node v) const
 Returns the node in the graph copy corresponding to v. More...
 
const List< edge > & chain (edge e) const
 Returns the list of edges coresponding to edge e. More...
 
edge copy (edge e) const
 Returns the first edge in the list of edges coresponding to edge e. More...
 
adjEntry copy (adjEntry adj) const
 Returns the adjacency entry in the copy graph corresponding to adj. More...
 
bool isDummy (node v) const
 Returns true iff v has no corresponding node in the original graph. More...
 
bool isDummy (edge e) const
 Returns true iff e has no corresponding edge in the original graph. More...
 
bool isReversed (edge e) const
 Returns true iff edge e has been reversed. More...
 
bool isReversedCopyEdge (edge e) const
 Returns true iff e is reversed w.r.t. More...
 
node newNode (node vOrig)
 Creates a new node in the graph copy with original node vOrig. More...
 
virtual void delNode (node v) override
 Removes node v and all its adjacent edges cleaning-up their corresponding lists of original edges. More...
 
virtual void delEdge (edge e) override
 Removes edge e and clears the list of edges corresponding to e's original edge. More...
 
virtual void clear () override
 Removes all nodes and all edges from the graph. More...
 
void unsplit (edge eIn, edge eOut) override
 Undoes a previous split operation. More...
 
edge newEdge (edge eOrig)
 Creates a new edge (v,w) with original edge eOrig. More...
 
void setEdge (edge eOrig, edge eCopy)
 sets eOrig to be the corresponding original edge of eCopy and vice versa More...
 
bool embed ()
 Embeds the graph copy. More...
 
void removePseudoCrossings ()
 Removes all crossing nodes which are actually only two "touching" edges. More...
 
bool hasSameEdgesCrossings () const
 Returns whether there are two edges in the GraphCopy that cross each other multiple times. More...
 
bool hasAdjacentEdgesCrossings () const
 Returns whether the GraphCopy contains at least one crossing of two adjacent edges. More...
 
bool hasNonSimpleCrossings () const
 Returns whether the GraphCopy contains crossings that will result in a non-simple drawing. More...
 
void removeNonSimpleCrossings (SListPure< edge > &edgesToCheck, DynamicDualGraph *dualGraph=nullptr)
 Removes all non-simple cossings involving edges from edgesToCheck (see hasNonSimpleCrossings() for a definition of non-simple crossings). More...
 
void removeNonSimpleCrossings (DynamicDualGraph *dualGraph=nullptr)
 Removes all non-simple cossings (see hasNonSimpleCrossings() for a definition of non-simple crossings). More...
 
void removeNonSimpleCrossings (node origNode, DynamicDualGraph *dualGraph=nullptr)
 Removes all non-simple cossings involving edges incident to origNode (see hasNonSimpleCrossings() for a definition of non-simple crossings). More...
 
void insertEdgePath (edge eOrig, const SList< adjEntry > &crossedEdges)
 Re-inserts edge eOrig by "crossing" the edges in crossedEdges. More...
 
void insertEdgePath (node srcOrig, node tgtOrig, const SList< adjEntry > &crossedEdges)
 Special version (for FixedEmbeddingUpwardEdgeInserter only). More...
 
void removeEdgePath (edge eOrig)
 Removes the complete edge path for edge eOrig. More...
 
edge insertCrossing (edge &crossingEdge, edge crossedEdge, bool rightToLeft)
 Inserts crossings between two copy edges. More...
 
node newNode ()
 Creates a new node and returns it. More...
 
node newNode (int index)
 Creates a new node with predefined index and returns it. More...
 
edge newEdge (node v, node w)
 Creates a new edge (v,w) and returns it. More...
 
edge newEdge (node v, node w, int index)
 Creates a new edge (v,w) with predefined index and returns it. More...
 
edge newEdge (adjEntry adjSrc, adjEntry adjTgt, Direction dir=Direction::after)
 Creates a new edge at predefined positions in the adjacency lists. More...
 
edge newEdge (node v, adjEntry adjTgt)
 Creates a new edge at predefined positions in the adjacency lists. More...
 
edge newEdge (adjEntry adjSrc, node w)
 Creates a new edge at predefined positions in the adjacency lists. More...
 
edge newEdge (node v, adjEntry adj, edge eOrig, CombinatorialEmbedding &E)
 Creates a new edge with original edge eOrig in an embedding E. More...
 
void setOriginalEmbedding ()
 Sets the embedding of the graph copy to the embedding of the original graph. More...
 
void insertEdgePathEmbedded (edge eOrig, CombinatorialEmbedding &E, const SList< adjEntry > &crossedEdges)
 Re-inserts edge eOrig by "crossing" the edges in crossedEdges in embedding E. More...
 
void insertEdgePathEmbedded (edge eOrig, CombinatorialEmbedding &E, DynamicDualGraph &dual, const SList< adjEntry > &crossedEdges)
 
void removeEdgePathEmbedded (CombinatorialEmbedding &E, edge eOrig, FaceSet< false > &newFaces)
 Removes the complete edge path for edge eOrig while preserving the embedding. More...
 
void removeEdgePathEmbedded (CombinatorialEmbedding &E, DynamicDualGraph &dual, edge eOrig)
 
void init (const Graph &G)
 Re-initializes the copy using the graph G. More...
 
void createEmpty (const Graph &G)
 Associates the graph copy with G, but does not create any nodes or edges. More...
 
void initByCC (const CCsInfo &info, int cc, EdgeArray< edge > &eCopy)
 Initializes the graph copy for the nodes in component cc. More...
 
void initByNodes (const List< node > &origNodes, EdgeArray< edge > &eCopy)
 Initializes the graph copy for the nodes in a component. More...
 
void initByActiveNodes (const List< node > &nodeList, const NodeArray< bool > &activeNodes, EdgeArray< edge > &eCopy)
 Initializes the graph copy for the nodes in nodeList. More...
 
GraphCopyoperator= (const GraphCopy &GC)
 Assignment operator. More...
 
- Public Member Functions inherited from ogdf::Graph
bool empty () const
 Returns true iff the graph is empty, i.e., contains no nodes. More...
 
int numberOfNodes () const
 Returns the number of nodes in the graph. More...
 
int numberOfEdges () const
 Returns the number of edges in the graph. More...
 
int maxNodeIndex () const
 Returns the largest used node index. More...
 
int maxEdgeIndex () const
 Returns the largest used edge index. More...
 
int maxAdjEntryIndex () const
 Returns the largest used adjEntry index. More...
 
int nodeArrayTableSize () const
 Returns the table size of node arrays associated with this graph. More...
 
int edgeArrayTableSize () const
 Returns the table size of edge arrays associated with this graph. More...
 
int adjEntryArrayTableSize () const
 Returns the table size of adjEntry arrays associated with this graph. More...
 
node firstNode () const
 Returns the first node in the list of all nodes. More...
 
node lastNode () const
 Returns the last node in the list of all nodes. More...
 
edge firstEdge () const
 Returns the first edge in the list of all edges. More...
 
edge lastEdge () const
 Returns the last edge in the list of all edges. More...
 
node chooseNode (std::function< bool(node)> includeNode=[](node) { return true;}, bool isFastTest=true) const
 Returns a random node. More...
 
edge chooseEdge (std::function< bool(edge)> includeEdge=[](edge) { return true;}, bool isFastTest=true) const
 Returns a random edge. More...
 
template<class CONTAINER >
void allNodes (CONTAINER &nodeContainer) const
 Returns a container with all nodes of the graph. More...
 
template<class CONTAINER >
void allEdges (CONTAINER &edgeContainer) const
 Returns a container with all edges of the graph. More...
 
node newNode ()
 Creates a new node and returns it. More...
 
node newNode (int index)
 Creates a new node with predefined index and returns it. More...
 
edge newEdge (node v, node w)
 Creates a new edge (v,w) and returns it. More...
 
edge newEdge (node v, node w, int index)
 Creates a new edge (v,w) with predefined index and returns it. More...
 
edge newEdge (adjEntry adjSrc, adjEntry adjTgt, Direction dir=Direction::after)
 Creates a new edge at predefined positions in the adjacency lists. More...
 
edge newEdge (node v, adjEntry adjTgt)
 Creates a new edge at predefined positions in the adjacency lists. More...
 
edge newEdge (adjEntry adjSrc, node w)
 Creates a new edge at predefined positions in the adjacency lists. More...
 
void insert (const Graph &G, NodeArray< node > &nodeMap)
 Inserts Graph G as a subgraph into this Graph. More...
 
void insert (const Graph &G)
 Inserts Graph G as a subgraph into this Graph. More...
 
void unsplit (node u)
 Undoes a split operation. More...
 
node splitNode (adjEntry adjStartLeft, adjEntry adjStartRight)
 Splits a node while preserving the order of adjacency entries. More...
 
node contract (edge e, bool keepSelfLoops=false)
 Contracts edge e while preserving the order of adjacency entries. More...
 
void move (edge e, adjEntry adjSrc, Direction dirSrc, adjEntry adjTgt, Direction dirTgt)
 Moves edge e to a different adjacency list. More...
 
void moveTarget (edge e, node w)
 Moves the target node of edge e to node w. More...
 
void moveTarget (edge e, adjEntry adjTgt, Direction dir)
 Moves the target node of edge e to a specific position in an adjacency list. More...
 
void moveSource (edge e, node w)
 Moves the source node of edge e to node w. More...
 
void moveSource (edge e, adjEntry adjSrc, Direction dir)
 Moves the source node of edge e to a specific position in an adjacency list. More...
 
edge searchEdge (node v, node w, bool directed=false) const
 Searches and returns an edge connecting nodes v and w in time O( min(deg(v ), deg(w ))). More...
 
void reverseEdge (edge e)
 Reverses the edge e, i.e., exchanges source and target node. More...
 
void reverseAllEdges ()
 Reverses all edges in the graph. More...
 
template<class NODELIST >
void collapse (NODELIST &nodesToCollapse)
 Collapses all nodes in the list nodesToCollapse to the first node in the list. More...
 
template<class ADJ_ENTRY_LIST >
void sort (node v, const ADJ_ENTRY_LIST &newOrder)
 Sorts the adjacency list of node v according to newOrder. More...
 
void reverseAdjEdges (node v)
 Reverses the adjacency list of v. More...
 
void moveAdj (adjEntry adjMove, Direction dir, adjEntry adjPos)
 Moves adjacency entry adjMove before or after adjPos. More...
 
void moveAdjAfter (adjEntry adjMove, adjEntry adjAfter)
 Moves adjacency entry adjMove after adjAfter. More...
 
void moveAdjBefore (adjEntry adjMove, adjEntry adjBefore)
 Moves adjacency entry adjMove before adjBefore. More...
 
void reverseAdjEdges ()
 Reverses all adjacency lists. More...
 
void swapAdjEdges (adjEntry adj1, adjEntry adj2)
 Exchanges two entries in an adjacency list. More...
 
int genus () const
 Returns the genus of the graph's embedding. More...
 
bool representsCombEmbedding () const
 Returns true iff the graph represents a combinatorial embedding. More...
 
ListIterator< NodeArrayBase * > registerArray (NodeArrayBase *pNodeArray) const
 Registers a node array. More...
 
ListIterator< EdgeArrayBase * > registerArray (EdgeArrayBase *pEdgeArray) const
 Registers an edge array. More...
 
ListIterator< AdjEntryArrayBase * > registerArray (AdjEntryArrayBase *pAdjArray) const
 Registers an adjEntry array. More...
 
ListIterator< GraphObserver * > registerStructure (GraphObserver *pStructure) const
 Registers a graph observer (e.g. a ClusterGraph). More...
 
void unregisterArray (ListIterator< NodeArrayBase * > it) const
 Unregisters a node array. More...
 
void unregisterArray (ListIterator< EdgeArrayBase * > it) const
 Unregisters an edge array. More...
 
void unregisterArray (ListIterator< AdjEntryArrayBase * > it) const
 Unregisters an adjEntry array. More...
 
void unregisterStructure (ListIterator< GraphObserver * > it) const
 Unregisters a graph observer. More...
 
template<class ArrayBase >
void moveRegisterArray (ListIterator< ArrayBase * > it, ArrayBase *pArray) const
 Move the registration it of an graph element array to pArray (used with move semantics for graph element arrays). More...
 
void resetEdgeIdCount (int maxId)
 Resets the edge id count to maxId. More...
 
 Graph ()
 Constructs an empty graph. More...
 
 Graph (const Graph &G)
 Constructs a graph that is a copy of G. More...
 
virtual ~Graph ()
 Destructor. More...
 
Graphoperator= (const Graph &G)
 Assignment operator. More...
 
- Public Member Functions inherited from ogdf::GraphObserver
 GraphObserver ()
 Constructs instance of GraphObserver class. More...
 
 GraphObserver (const Graph *G)
 Constructs instance of GraphObserver class. More...
 
virtual ~GraphObserver ()
 Destroys the instance, unregisters it from watched graph. More...
 
const GraphgetGraph () const
 
void reregister (const Graph *pG)
 Associates observer instance with graph G. More...
 

Protected Member Functions

node initActiveCCGen (int i, bool minNode)
 Initializes CC with active nodes (minNode ? at least one node) More...
 
void initMembers (const UMLGraph &UG)
 
- Protected Member Functions inherited from ogdf::PlanRepUML
void prepareIncrementalMergers (int indexCC, CombinatorialEmbedding &E)
 
- Protected Member Functions inherited from ogdf::PlanRep
void setCopyType (edge eCopy, edge eOrig)
 
edgeType generalizationPattern () const
 
edgeType associationPattern () const
 
edgeType expansionPattern () const
 
edgeType assClassPattern () const
 
edgeType brotherPattern () const
 
edgeType halfBrotherPattern () const
 
edgeType cliquePattern () const
 
- Protected Member Functions inherited from ogdf::GraphCopy
void removeUnnecessaryCrossing (adjEntry adjA1, adjEntry adjA2, adjEntry adjB1, adjEntry adjB2)
 
void removeUnnecessaryCrossing (adjEntry adj, DynamicDualGraph *dualGraph)
 Removes the pseudo crossing that adj belongs to. More...
 
void removeAdjacentEdgesCrossing (adjEntry adj1, adjEntry adj2, DynamicDualGraph *dualGraph)
 Removes the crossing of the two adjacent edges adj1->theEdge() and adj2->theEdge(). More...
 
void removeSameEdgesCrossing (adjEntry adjFirstCrossing1, adjEntry adjFirstCrossing2, adjEntry adjSecondCrossing1, adjEntry adjSecondCrossing2, DynamicDualGraph *dualGraph)
 Removes the two crossings given by the adjEntries, assuming that both crossings stem from the same two edges. More...
 
void swapOriginalEdgesAtCrossing (adjEntry adjCopy1, adjEntry adjCopy2, DynamicDualGraph *dual=nullptr)
 Swaps the original edges from adjCopy1 up to the common node of {adjCopy1, adjCopy2} with the original edges from adjCopy2 up to the same common node. More...
 
void swapOriginalEdgesBetweenCrossings (adjEntry adjFirstCrossing1, adjEntry adjFirstCrossing2, adjEntry adjSecondCrossing1, adjEntry adjSecondCrossing2, DynamicDualGraph *dual=nullptr)
 Swaps the original edges from adjFirstCrossing1 up to adjSecondCrossing1->theNode() with the original edges from adjFirstCrossing2 up to adjSecondCrossing2->theNode(). More...
 
void setOriginalEdgeAlongCrossings (adjEntry adjCopy1, adjEntry adjCopy2, node vCopy, edge eOrig1, edge eOrig2)
 Sets the original edges from adjCopy1 up to vCopy to eOrig2, and the original edges from adjCopy2 up to vCopy to eOrig1. More...
 
- Protected Member Functions inherited from ogdf::Graph
void construct (const Graph &G, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)
 
void assign (const Graph &G, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)
 
void constructInitByNodes (const Graph &G, const List< node > &nodeList, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)
 Constructs a copy of the subgraph of G induced by nodeList. More...
 
void constructInitByActiveNodes (const List< node > &nodeList, const NodeArray< bool > &activeNodes, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)
 
void constructInitByCC (const CCsInfo &info, int cc, NodeArray< node > &mapNode, EdgeArray< edge > &mapEdge)
 Constructs a copy of connected component cc in info. More...
 

Private Attributes

NodeArray< bool > m_activeNodes
 stores the status of the nodes More...
 
NodeArray< int > m_component
 number of partial component in current CC used for treeConnection More...
 
Array2D< edgem_eTreeArray
 used for treeConnection More...
 
EdgeArray< bool > m_treeEdge
 edge inserted for connnectivity More...
 
bool m_treeInit
 check if the tree edge Array2D was initialized More...
 

Additional Inherited Members

- Public Types inherited from ogdf::Graph
enum  EdgeType { EdgeType::association = 0, EdgeType::generalization = 1, EdgeType::dependency = 2 }
 The type of edges (only used in derived classes). More...
 
enum  NodeType { NodeType::vertex = 0, NodeType::dummy = 1, NodeType::generalizationMerger = 2, NodeType::generalizationExpander = 3, NodeType::highDegreeExpander = 4, NodeType::lowDegreeExpander = 5, NodeType::associationClass = 6 }
 The type of nodes. More...
 
using node_iterator = internal::GraphIterator< node >
 Provides a bidirectional iterator to a node in a graph. More...
 
using edge_iterator = internal::GraphIterator< edge >
 Provides a bidirectional iterator to an edge in a graph. More...
 
using adjEntry_iterator = internal::GraphIterator< adjEntry >
 Provides a bidirectional iterator to an entry in an adjacency list. More...
 
- Public Attributes inherited from ogdf::Graph
internal::GraphObjectContainer< NodeElementnodes
 The container containing all node objects. More...
 
internal::GraphObjectContainer< EdgeElementedges
 The container containing all edge objects. More...
 
- Protected Attributes inherited from ogdf::PlanRepUML
AdjEntryArray< bool > m_alignUpward
 
- Protected Attributes inherited from ogdf::PlanRep
int m_currentCC
 The index of the current component. More...
 
Graph::CCsInfo m_ccInfo
 
const GraphAttributesm_pGraphAttributes
 Pointer to graph attributes of original graph. More...
 
NodeArray< NodeTypem_vType
 Simple node types. More...
 
NodeArray< nodeTypem_nodeTypes
 Node types for extended semantic information. More...
 
NodeArray< nodem_expandedNode
 For all expansion nodes, save expanded node. More...
 
NodeArray< adjEntrym_expandAdj
 
NodeArray< adjEntrym_boundaryAdj
 
EdgeArray< int > m_expansionEdge
 
EdgeArray< EdgeTypem_eType
 
EdgeArray< edgeTypem_edgeTypes
 
EdgeArray< edgeTypem_oriEdgeTypes
 
EdgeArray< edgem_eAuxCopy
 
- Protected Attributes inherited from ogdf::GraphCopy
EdgeArray< List< edge > > m_eCopy
 The corresponding list of edges in the graph copy. More...
 
EdgeArray< ListIterator< edge > > m_eIterator
 The position of copy edge in the list. More...
 
EdgeArray< edgem_eOrig
 The corresponding edge in the original graph. More...
 
const Graphm_pGraph
 The original graph. More...
 
NodeArray< nodem_vCopy
 The corresponding node in the graph copy. More...
 
NodeArray< nodem_vOrig
 The corresponding node in the original graph. More...
 
- Protected Attributes inherited from ogdf::GraphObserver
ListIterator< GraphObserver * > m_itGList
 watched graph More...
 
const Graphm_pGraph
 

Detailed Description

This class is only an adaption of PlanRep for the special incremental drawing case.

As incremental layout only makes sense with a given layout, this PlanRepInc copes with layout information and embedding.

Definition at line 55 of file PlanRepInc.h.

Constructor & Destructor Documentation

◆ PlanRepInc() [1/2]

ogdf::PlanRepInc::PlanRepInc ( const UMLGraph UG)
explicit

Constructor for interactive updates (parts added step by step)

◆ PlanRepInc() [2/2]

ogdf::PlanRepInc::PlanRepInc ( const UMLGraph UG,
const NodeArray< bool > &  fixed 
)

Constructor for incremental updates (whole graph already given). The part to stay fixed has fixed value set to true.

Member Function Documentation

◆ activateEdge()

void ogdf::PlanRepInc::activateEdge ( edge  e)

Sets activity status to true and updates the structures.

◆ activateNode()

void ogdf::PlanRepInc::activateNode ( node  v)

Sets activity status to true and updates the structures. Node activation activates all adjacent edges.

◆ cleared()

virtual void ogdf::PlanRepInc::cleared ( )
overridevirtual

Called by watched graph when its clear function is called Has to be implemented by derived classes.

Implements ogdf::GraphObserver.

◆ componentNumber()

int& ogdf::PlanRepInc::componentNumber ( node  v)
inline

Component number.

Definition at line 110 of file PlanRepInc.h.

◆ deleteTreeConnection() [1/2]

void ogdf::PlanRepInc::deleteTreeConnection ( int  i,
int  j 
)

Deletes an edge again.

◆ deleteTreeConnection() [2/2]

void ogdf::PlanRepInc::deleteTreeConnection ( int  i,
int  j,
CombinatorialEmbedding E 
)

◆ edgeAdded()

virtual void ogdf::PlanRepInc::edgeAdded ( edge  e)
overridevirtual

Called by watched graph when an edge is added Has to be implemented by derived classes.

Implements ogdf::GraphObserver.

◆ edgeDeleted()

virtual void ogdf::PlanRepInc::edgeDeleted ( edge  e)
overridevirtual

Called by watched graph when an edge is deleted Has to be implemented by derived classes.

Implements ogdf::GraphObserver.

◆ getExtAdj()

adjEntry ogdf::PlanRepInc::getExtAdj ( GraphCopy GC,
CombinatorialEmbedding E 
)

◆ getExtAdjs()

void ogdf::PlanRepInc::getExtAdjs ( List< adjEntry > &  extAdjs)

Sets a list of adjentries on "external" faces of unconnected active parts of the current CC.

◆ initActiveCC()

void ogdf::PlanRepInc::initActiveCC ( int  i)

Inits a CC only with active elements.

◆ initActiveCCGen()

node ogdf::PlanRepInc::initActiveCCGen ( int  i,
bool  minNode 
)
protected

Initializes CC with active nodes (minNode ? at least one node)

◆ initMembers()

void ogdf::PlanRepInc::initMembers ( const UMLGraph UG)
protected

◆ initMinActiveCC()

node ogdf::PlanRepInc::initMinActiveCC ( int  i)

Inits a CC with at least one active node, makes a node active if necessary and returns it. Returns nullptr otherwise.

◆ makeTreeConnected()

bool ogdf::PlanRepInc::makeTreeConnected ( adjEntry  adjExternal)

Handles copies of original CCs that are split into unconnected parts of active nodes by connecting them tree-like, adding necessary edges at "external" nodes of the partial CCs. Note that this only makes sense when the CC parts are already correctly embedded.

◆ nodeAdded()

virtual void ogdf::PlanRepInc::nodeAdded ( node  v)
overridevirtual

Called by watched graph when a node is added Has to be implemented by derived classes.

Implements ogdf::GraphObserver.

◆ nodeDeleted()

virtual void ogdf::PlanRepInc::nodeDeleted ( node  v)
overridevirtual

In the case that the underlying incremental structure changes, we update this copy.

Implements ogdf::GraphObserver.

◆ reInit()

virtual void ogdf::PlanRepInc::reInit ( )
overridevirtual

Called by watched graph when it is reinitialized Has to be implemented by derived classes.

Implements ogdf::GraphObserver.

◆ split()

virtual edge ogdf::PlanRepInc::split ( edge  e)
inlineoverridevirtual

Splits edge e, can be removed when edge status in edgetype m_treedge can be removed afterwards.

Reimplemented from ogdf::PlanRepUML.

Definition at line 128 of file PlanRepInc.h.

◆ treeEdge() [1/2]

bool& ogdf::PlanRepInc::treeEdge ( edge  e)
inline

Definition at line 112 of file PlanRepInc.h.

◆ treeEdge() [2/2]

edge ogdf::PlanRepInc::treeEdge ( int  i,
int  j 
) const
inline

Definition at line 114 of file PlanRepInc.h.

◆ treeInit()

bool ogdf::PlanRepInc::treeInit ( )
inline

Definition at line 121 of file PlanRepInc.h.

Member Data Documentation

◆ m_activeNodes

NodeArray<bool> ogdf::PlanRepInc::m_activeNodes
private

stores the status of the nodes

Definition at line 167 of file PlanRepInc.h.

◆ m_component

NodeArray<int> ogdf::PlanRepInc::m_component
private

number of partial component in current CC used for treeConnection

Definition at line 169 of file PlanRepInc.h.

◆ m_eTreeArray

Array2D<edge> ogdf::PlanRepInc::m_eTreeArray
private

used for treeConnection

Definition at line 170 of file PlanRepInc.h.

◆ m_treeEdge

EdgeArray<bool> ogdf::PlanRepInc::m_treeEdge
private

edge inserted for connnectivity

Definition at line 168 of file PlanRepInc.h.

◆ m_treeInit

bool ogdf::PlanRepInc::m_treeInit
private

check if the tree edge Array2D was initialized

Definition at line 171 of file PlanRepInc.h.


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