greedy_random_outerplanar.cc

Go to the documentation of this file.

#include <iostream>
#include <lemon/smart_graph.h>
#include <utils/graph_utils.hh>
#include <minlca/greedy.hh>
#include <utils/timer.hh>
#include <minlca/profiler.hh>
#include <lemon/graph_to_eps.h>
#include <utils/generators/outerplanar.hh>
using namespace std;
using namespace lemon;
using namespace minlca;
using namespace minlca::utils;

template<typename Graph>
int shape(typename Graph::Node)
{
  return 0;
}


int main(int argc, char **argv)
{
  GRAPH_TYPEDEFS(RandomOuterplanar<>);

  Timer timer;
  RandomOuterplanar<> g(atoi(argv[2]));
  g.init(atoi(argv[1])).generate();
  int top = g.sideA();

  cout << "Graph generation time: " << timer.elapsed() << endl;
  cout << endl;

  int n = countNodes(g);
  cout << "Total nodes: " << n << endl;
  cout << "Total edges: " << countEdges(g) << endl;
  cout << "Random seed: " << argv[2] << endl;

  cout << endl;
  cout << "Using greedy nearest:" << endl;

  MinLCAProfiler<MinLCAGreedyNearestBfs<RandomOuterplanar<>>> greedyNearest(g);
  cout << "Creation elapsed time: " << greedyNearest.creationTime() << endl;
  greedyNearest.init();
  cout << "Initialisation elapsed time: " << greedyNearest.initTime() << endl;

  if (greedyNearest.run() == SOLUTION_FOUND) {
    cout << "Algorithm running time: " << greedyNearest.runTime() << endl;
    cout << "Max colours: " << greedyNearest.maxK() << endl;
    cout << "Colours used: " << greedyNearest.totalColours() << endl;
    cout << "LCA value: " << greedyNearest.lcaValue() << endl;
  }
  else {
    cout << "Could not find a solution!" << endl;
  }

  cout << endl;

  cout << "Using greedy least cost:" << endl;

  MinLCAProfiler<MinLCAGreedyLeastCostBfs<RandomOuterplanar<>>> greedyLeastCost(
    g);
  cout << "Creation elapsed time: " << greedyLeastCost.creationTime() << endl;
  greedyLeastCost.init();
  cout << "Initialisation elapsed time: " << greedyLeastCost.initTime() << endl;

  if (greedyLeastCost.run() == SOLUTION_FOUND) {
    cout << "Algorithm running time: " << greedyLeastCost.runTime() << endl;
    cout << "Max colours: " << greedyLeastCost.maxK() << endl;
    cout << "Colours used: " << greedyLeastCost.totalColours() << endl;
    cout << "LCA value: " << greedyLeastCost.lcaValue() << endl;
  }
  else {
    cout << "Could not find a solution!" << endl;
  }

  if (argc > 3) {
    RandomOuterplanar<>::NodeMap <dim2::Point<double>> coords(g);

    double pi2 = 2.0 * M_PI;

    for (int v = 0; v < top; ++v) {
      double angle = v * pi2 / n;
      coords[g.nodeFromId(v)] = dim2::Point<double>(cos(angle), sin(angle));
    }

    for (int v = top; v < n; ++v) {
      double angle = (n - 1 - v + top) * pi2 / n;
      coords[g.nodeFromId(v)] = dim2::Point<double>(cos(angle), sin(angle));
    }

    auto shapes = functorToMap(shape<RandomOuterplanar<>>);
    graphToEps(g, argv[3])
    .coords(coords)
    .nodeShapes(shapes)
    .nodeScale(.003)
    //.hideNodes()
    .edgeWidthScale(.00005)
    .undirected()
    .scaleToA4()
    .run();
  }
}