89 const Graph* m_originalGraph =
nullptr;
Declaration of ClusterPlanRep class, allowing cluster boundary insertion and shortest path edge inser...
Edge insertion algorithm for clustered graphs.
PostProcessType getPostProcessing()
void writeGML(std::ostream &os, const Layout &drawing)
EdgeArray< int > m_eStatus
Status of dual graph arcs.
EdgeArray< adjEntry > m_arcOrig
Original edges adj entry.
PostProcessType
Postprocessing options.
void setArcStatus(edge eArc, node oSrc, node oTgt, const ClusterGraph &CG, NodeArray< cluster > &clusterOfFaceNode, EdgeArray< edge > &arcTwin)
void setPostProcessing(PostProcessType p)
void constructDualGraph(ClusterPlanRep &CPR, CombinatorialEmbedding &E, EdgeArray< edge > &arcRightToLeft, EdgeArray< edge > &arcLeftToRight, FaceArray< node > &nodeOfFace, EdgeArray< edge > &arcTwin)
void writeDual(const char *fileName)
void deriveFaceCluster(ClusterPlanRep &CPR, CombinatorialEmbedding &E, const ClusterGraph &CG, FaceArray< node > &nodeOfFace, NodeArray< cluster > &clusterOfFaceNode)
Compute for every face the cluster that surrounds it.
void findShortestPath(const CombinatorialEmbedding &E, node s, node t, node sDummy, node tDummy, SList< adjEntry > &crossed, FaceArray< node > &nodeOfFace)
virtual ~CPlanarEdgeInserter()
void postProcess()
Use heuristics to improve the result if possible.
void insertEdge(ClusterPlanRep &CPR, CombinatorialEmbedding &E, edge insertMe, FaceArray< node > &nodeOfFace, EdgeArray< edge > &arcRightToLeft, EdgeArray< edge > &arcLeftToRight, EdgeArray< edge > &arcTwin, NodeArray< cluster > &clusterOfFaceNode, const SList< adjEntry > &crossed)
void call(ClusterPlanRep &CPR, CombinatorialEmbedding &E, const Graph &G, const List< edge > &origEdges)
Representation of clustered graphs.
Planarized representations for clustered graphs.
Combinatorial embeddings of planar graphs with modification functionality.
Dynamic arrays indexed with edges.
Class for the representation of edges.
Dynamic arrays indexed with faces of a combinatorial embedding.
Data type for general directed graphs (adjacency list representation).
Stores a layout of a graph (coordinates of nodes, bend points of edges).
Doubly linked lists (maintaining the length of the list).
Dynamic arrays indexed with nodes.
Class for the representation of nodes.
Singly linked lists (maintaining the length of the list).
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF DLL.
static MultilevelBuilder * getDoubleFactoredZeroAdjustedMerger()
The namespace for all OGDF objects.
@ None
Two geometric objects do not intersect.