 |
Open Graph Drawing Framework |
v. 2023.09 (Elderberry)
|
|
|
Go to the documentation of this file.
99 const Graph* m_originalGraph =
nullptr;
111 void writeDual(
const char* fileName);
112 void writeGML(std::ostream& os,
const Layout& drawing);
The namespace for all OGDF objects.
Includes declaration of graph class.
Planarized representations for clustered graphs.
PostProcessType
Postprocessing options.
Singly linked lists (maintaining the length of the list).
virtual ~CPlanarEdgeInserter()
PostProcessType getPostProcessing()
Stores a layout of a graph (coordinates of nodes, bend points of edges).
Declaration of singly linked lists and iterators.
RegisteredArray for nodes, edges and adjEntries of a graph.
Data type for general directed graphs (adjacency list representation).
EdgeArray< int > m_eStatus
Status of dual graph arcs.
RegisteredArray for labeling the faces of a CombinatorialEmbedding.
Edge insertion algorithm for clustered graphs.
Basic declarations, included by all source files.
Declaration of CombinatorialEmbedding and face.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF dynamic library (shared object / DLL),...
Combinatorial embeddings of planar graphs with modification functionality.
Class for the representation of edges.
Derived class of GraphObserver providing additional functionality to handle clustered graphs.
EdgeArray< adjEntry > m_arcOrig
Original edges adj entry.
@ None
Two geometric objects do not intersect.
Representation of clustered graphs.
Class for the representation of nodes.
void setPostProcessing(PostProcessType p)
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.