46 std::vector<std::pair<adjEntry, adjEntry>>* m_augmentation =
nullptr;
59 m_augmentation = augmentation;
63 return m_augmentation;
98 std::vector<std::pair<adjEntry, adjEntry>>& augmentation,
EdgeSet* added =
nullptr,
99 bool embedded =
true,
bool assert_minimal =
true);
Derived class of GraphObserver providing additional functionality to handle clustered graphs.
Declaration of ClusterPlanarityModule which implements a cluster-planarity test and,...
Includes declaration of graph class.
Declaration and implementation of NodeSet, EdgeSet, and AdjEntrySet classes.
Basic declarations, included by all source files.
RegisteredArray for labeling the clusters of a ClusterGraph.
Representation of clustered graphs.
Data type for general directed graphs (adjacency list representation).
ClusterPlanarity testing in quadratic time using the Synchronized Planarity approach.
bool isClusterPlanar(const ClusterGraph &CG) override
Returns true, if CG is cluster-planar, false otherwise.
bool clusterPlanarEmbedClusterPlanarGraph(ClusterGraph &CG, Graph &G) override
Constructs a cluster-planar embedding of CG. CG has to be cluster-planar!
bool isClusterPlanarDestructive(ClusterGraph &CG, Graph &G) override
Returns true, if CG is cluster-planar, false otherwise. In it is non-cluster-planar,...
void setStoreAugmentation(std::vector< std::pair< adjEntry, adjEntry > > *augmentation)
When set to a non-null pointer, will contain the augmentation edges to make the graph c-connected c-p...
std::vector< std::pair< adjEntry, adjEntry > > * getStoreAugmentation() const
void copyBackEmbedding(ClusterGraph &CG, Graph &G, const ClusterGraph &CGcopy, const Graph &Gcopy, const ClusterArray< cluster, true > ©C, const NodeArray< node, true > ©N, const EdgeArray< edge, true > ©E, const EdgeArray< edge, true > &origE) const override
RegisteredArray for edges of a graph, specialized for EdgeArray<edge>.
RegisteredArray for nodes, edges and adjEntries of a graph.
#define OGDF_EXPORT
Specifies that a function or class is exported by the OGDF dynamic library (shared object / DLL),...
The namespace for all OGDF objects.
void insertAugmentationEdges(const ClusterGraph &CG, Graph &G, std::vector< std::pair< adjEntry, adjEntry > > &augmentation, EdgeSet *added=nullptr, bool embedded=true, bool assert_minimal=true)
Inserts augmentation edges to make a c-plane graph c-connected while maintaining the combinatorial em...
void reduceLevelPlanarityToClusterPlanarity(const Graph &LG, const std::vector< std::vector< node > > &emb, Graph &G, ClusterGraph &CG, EdgeArray< node > &embMap)
Perform the reduction from level- to cluster planarity.