 |
Open Graph Drawing Framework |
v. 2022.02 (Dogwood)
|
|
|
Go to the documentation of this file.
66 void initActiveCC(
int i);
69 node initMinActiveCC(
int i);
74 virtual void nodeDeleted(
node v)
override;
75 virtual void nodeAdded(
node v)
override;
76 virtual void edgeDeleted(
edge e)
override;
77 virtual void edgeAdded(
edge e)
override;
78 virtual void reInit()
override;
79 virtual void cleared()
override;
84 void activateNode(
node v);
87 void activateEdge(
edge e);
96 bool makeTreeConnected(
adjEntry adjExternal);
100 void deleteTreeConnection(
int i,
int j);
117 return m_eTreeArray(i, j);
131 if (m_treeEdge[e]) m_treeEdge[eNew] =
true;
139 void writeGML(
const char *fileName)
142 std::ofstream os(fileName);
145 void writeGML(
const char *fileName,
const Layout &drawing)
147 std::ofstream os(fileName);
148 writeGML(os, drawing);
151 void writeGML(std::ostream &os,
const GraphAttributes &AG);
152 void writeGML(std::ostream &os,
const Layout &drawing,
bool colorEmbed =
true);
155 int genusLayout(Layout &drawing)
const;
161 void initMembers(
const UMLGraph &UG);
164 node initActiveCCGen(
int i,
bool minNode);
Array2D< edge > m_eTreeArray
used for treeConnection
The namespace for all OGDF objects.
Stores additional attributes of a graph (like layout information).
Declaration of class GraphAttributes which extends a Graph by additional attributes.
edge treeEdge(int i, int j) const
Planarized representation (of a connected component) of a UMLGraph; allows special handling of hierar...
Declaration of class PlanRepUML.
virtual edge split(edge e) override
Splits edge e, can be removed when edge status in edgetype m_treedge can be removed afterwards.
Declaration of class UMLGraph.
Copies of graphs supporting edge splitting.
The parameterized class Array2D implements dynamic two-dimensional arrays.
bool m_treeInit
check if the tree edge Array2D was initialized
Declaration of a base class for planar representations of graphs and cluster graphs.
Class for adjacency list elements.
NodeElement * node
The type of nodes.
Abstract Base class for graph observers.
Doubly linked lists (maintaining the length of the list).
virtual edge split(edge e) override
Splits edge e.
int & componentNumber(node v)
Component number.
This class is only an adaption of PlanRep for the special incremental drawing case.
Abstract base class for structures on graphs, that need to be informed about graph changes (e....
EdgeArray< bool > m_treeEdge
edge inserted for connnectivity
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
Combinatorial embeddings of planar graphs with modification functionality.
NodeArray< int > m_component
number of partial component in current CC used for treeConnection
Class for the representation of edges.
Declaration and implementation of class Array2D which implements dynamic two dimensional arrays.
Class for the representation of nodes.
NodeArray< bool > m_activeNodes
stores the status of the nodes