Open
Graph Drawing
Framework

 v. 2023.09 (Elderberry)
 

subgraph-planarizer.cpp
Go to the documentation of this file.
6 
7 using namespace ogdf;
8 
9 int main()
10 {
11  Graph G;
12  randomSimpleGraph(G, 100, 150);
13 
17 
18  int crossNum;
19  PlanRep PR(G);
20  SP.call(PR, 0, crossNum);
21 
22  std::cout << crossNum << " crossings" << std::endl;
23  GraphIO::write(PR, "output-plan.gml", GraphIO::writeGML);
24 
25  return 0;
26 }
ogdf
The namespace for all OGDF objects.
Definition: AugmentationModule.h:36
VariableEmbeddingInserter.h
Declaration of class VariablEmbeddingInserter.
graph_generators.h
Declaration of graph generators.
ogdf::GraphIO::write
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.
ogdf::PlanRep
Planarized representations (of a connected component) of a graph.
Definition: PlanRep.h:57
ogdf::GraphIO::writeGML
static bool writeGML(const Graph &G, std::ostream &os)
Writes graph G in GML format to output stream os.
ogdf::VariableEmbeddingInserter
Optimal edge insertion module.
Definition: VariableEmbeddingInserter.h:51
PlanarSubgraphFast.h
Declaration of the PlanarSubgraphFast.
SubgraphPlanarizer.h
Declaration of class SubgraphPlanarizer.
ogdf::SubgraphPlanarizer::setInserter
void setInserter(EdgeInsertionModule *pInserter)
Sets the module option for the edge insertion module.
Definition: SubgraphPlanarizer.h:133
ogdf::PlanarSubgraphFast
Computation of a planar subgraph using PQ-trees.
Definition: PlanarSubgraphFast.h:69
main
int main()
Definition: subgraph-planarizer.cpp:9
GraphIO.h
Declares class GraphIO which provides access to all graph read and write functionality.
ogdf::Graph
Data type for general directed graphs (adjacency list representation).
Definition: Graph_d.h:862
ogdf::CrossingMinimizationModule::call
ReturnType call(PlanRep &pr, int cc, int &crossingNumber, const EdgeArray< int > *pCostOrig=nullptr, const EdgeArray< bool > *pForbiddenOrig=nullptr, const EdgeArray< uint32_t > *pEdgeSubGraphs=nullptr)
Computes a planarized representation of the input graph.
Definition: CrossingMinimizationModule.h:70
ogdf::SubgraphPlanarizer::setSubgraph
void setSubgraph(PlanarSubgraphModule< int > *pSubgraph)
Sets the module option for the computation of the planar subgraph.
Definition: SubgraphPlanarizer.h:130
ogdf::SubgraphPlanarizer
The planarization approach for crossing minimization.
Definition: SubgraphPlanarizer.h:106
ogdf::randomSimpleGraph
bool randomSimpleGraph(Graph &G, int n, int m)
Creates a random simple graph.