26 std::vector<std::pair<adjEntry, adjEntry>> augmentation;
31 throw std::runtime_error(
"Not c-planar!");
44 for (
edge e : added) {
Derived class of GraphObserver providing additional functionality to handle clustered graphs.
Declares ClusterGraphAttributes, an extension of class GraphAttributes, to store clustergraph layout ...
Utilities for reducing from Cluster Planarity to SyncPlan.
Declaration of class ClusterPlanarizationLayout Planarization approach for cluster graphs.
Includes declaration of graph class.
Declares class GraphIO which provides access to all graph read and write functionality.
Declaration and implementation of NodeSet, EdgeSet, and AdjEntrySet classes.
Declaration of doubly linked lists and iterators.
Stores additional attributes of a clustered graph (like layout information).
static const long all
Enables all available flags.
Representation of clustered graphs.
virtual bool clusterPlanarEmbed(ClusterGraph &CG, Graph &G)
Returns true, if CG is cluster-planar, false otherwise. If true, CG contains a cluster-planar embeddi...
The cluster planarization layout algorithm.
virtual void call(Graph &G, ClusterGraphAttributes &acGraph, ClusterGraph &cGraph, bool simpleCConnect=true)
Calls cluster planarization layout with cluster-graph attributes acGraph.
Class for the representation of edges.
Functionality for temporarily hiding edges in constant time.
void hide(edge e)
Hides the given edge.
Data type for general directed graphs (adjacency list representation).
static bool write(const Graph &G, const string &filename, WriterFunc writer=nullptr)
Writes graph G to a file with name filename and infers the format to use from the file's extension.
ClusterPlanarity testing in quadratic time using the Synchronized Planarity approach.
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...
Declaration of randomized clustering generators.
void randomClusterPlanarGraph(Graph &G, ClusterGraph &CG, int clusters, int node_per_cluster, int edges_per_cluster)
Create a random planar graph with a c-planar clustering.
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...