Open
Graph Drawing
Framework

#include <ogdf/basic/Graph.h>

#include <ogdf/basic/graph_generators.h>

#include <ogdf/fileformats/GraphIO.h>

#include <ogdf/planarity/PlanRep.h>

#include <ogdf/planarity/PlanarSubgraphFast.h>

#include <ogdf/planarity/SubgraphPlanarizer.h>

#include <ogdf/planarity/VariableEmbeddingInserter.h>

#include <iostream>

#include <string>


using namespace ogdf;


int main()

{

    Graph G;

    randomSimpleGraph(G, 100, 150);


    SubgraphPlanarizer SP;

    SP.setSubgraph(new PlanarSubgraphFast<int>);

    SP.setInserter(new VariableEmbeddingInserter);


    int crossNum;

    PlanRep PR(G);

    SP.call(PR, 0, crossNum);


    std::cout << crossNum << " crossings" << std::endl;

    GraphIO::write(PR, "output-plan.gml", GraphIO::writeGML);


    return 0;

}


Graph.h
Includes declaration of graph class.

GraphIO.h
Declares class GraphIO which provides access to all graph read and write functionality.

PlanRep.h
Declaration of a base class for planar representations of graphs and cluster graphs.

PlanarSubgraphFast.h
Declaration of the PlanarSubgraphFast.

SubgraphPlanarizer.h
Declaration of class SubgraphPlanarizer.

VariableEmbeddingInserter.h
Declaration of class VariablEmbeddingInserter.

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:77

ogdf::Graph
Data type for general directed graphs (adjacency list representation).
Definition Graph_d.h:866

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::GraphIO::writeGML
static bool writeGML(const Graph &G, std::ostream &os)
Writes graph G in GML format to output stream os.

ogdf::PlanRep
Planarized representations (of a connected component) of a graph.
Definition PlanRep.h:68

ogdf::PlanarSubgraphFast
Computation of a planar subgraph using PQ-trees.
Definition PlanarSubgraphFast.h:82

ogdf::SubgraphPlanarizer
The planarization approach for crossing minimization.
Definition SubgraphPlanarizer.h:112

ogdf::SubgraphPlanarizer::setInserter
void setInserter(EdgeInsertionModule *pInserter)
Sets the module option for the edge insertion module.
Definition SubgraphPlanarizer.h:139

ogdf::SubgraphPlanarizer::setSubgraph
void setSubgraph(PlanarSubgraphModule< int > *pSubgraph)
Sets the module option for the computation of the planar subgraph.
Definition SubgraphPlanarizer.h:136

ogdf::VariableEmbeddingInserter
Optimal edge insertion module.
Definition VariableEmbeddingInserter.h:58

graph_generators.h
Declaration of graph generators.

ogdf::randomSimpleGraph
bool randomSimpleGraph(Graph &G, int n, int m)
Creates a random simple graph.

ogdf
The namespace for all OGDF objects.
Definition multilevelmixer.cpp:39

main
int main()
Definition subgraph-planarizer.cpp:13