benchmark_mps/make_planar/ogdf_mps_exact.cpp

#include <ogdf/basic/STNumbering.h>
#include <ogdf/fileformats/GraphIO.h>
// #include <ogdf/basic/extended_graph_alg.h>

#include <ogdf/planarity/PlanarSubgraphFast.h>
#include <ogdf/planarity/PlanarSubgraphBoyerMyrvold.h>
#include <ogdf/planarity/PlanarSubgraphPC.h>
#include <ogdf/planarity/MaximumPlanarSubgraph.h>
#include <ogdf/planarity/MaximalPlanarSubgraphSimple.h>

#include <iostream>
#include <map>
#include <chrono>
#include <getopt.h>

using namespace ogdf;


int main(int argc, char* argv[]) 
{

    string inputFile = argv[1];
    Graph G;

    if (!GraphIO::read(G, inputFile, GraphIO::readGML)) {
        std::cerr << "Could not read input.gml" << std::endl;
        return 1;
    }


    // print after input
    // graphPrinter(G);
    std::cout << "G Planarity: " << ogdf::isPlanar(G) << std::endl;
    std::cout << "Original number of nodes: " << G.numberOfNodes() << std::endl;
    std::cout << "Original number of edges: " << G.numberOfEdges() << std::endl;

    // separator for planarization
    // <-------------->

    // PQ implementation to make planar subgraph
    std::cout << "start planarization" << std::endl;
    List<edge> *delEdges = new List<edge>; // empty list

    std::cout << "running maximum" << std::endl;
    ogdf::MaximumPlanarSubgraph<int> mps;
    mps.call(G, *delEdges);

    
    std::cout << "Edges removed:" << delEdges->size() << std::endl;


    // delete removed edges
    for (edge e: *delEdges) {
        // print removed edges
        // std::cout << e->adjSource() << std::endl;
        G.delEdge(e);
    }


    // write processed graph to new gml file
    // GraphIO::write(G, "output.gml", GraphIO::writeGML);
    

    std::cout << "G planarity: " << ogdf::isPlanar(G) << std::endl;
    std::cout << "Original number of nodes: " << G.numberOfNodes() << std::endl;
    std::cout << "Subgraph number of edges: " << G.numberOfEdges() << std::endl;


    return 0;
}