sa_greedy_read_graph.cc

Go to the documentation of this file.

#include <iostream>
#include <lemon/smart_graph.h>
#include <utils/graph_utils.hh>
#include <minlca/optimisation-sa-greedy.hh>
#include <utils/timer.hh>
#include <minlca/profiler.hh>
#include <minlca/greedy.hh>
using namespace std;
using namespace lemon;
using namespace minlca;
using namespace minlca::utils;


int main(int argc, char **argv)
{
  GRAPH_TYPEDEFS(SmartGraph);
  SmartGraph g;
  ifstream graphFile(argv[1]);
  GraphFormat format = RMF;

  if (string(argv[2]) == "GRA") {
    format = GRA;
  }

  Timer timer;
  readGraph(g, format, graphFile);

  graphFile.close();

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

  int n = countNodes(g);
  cout << "Total nodes: " << n << endl;
  cout << "Total edges: " << countEdges(g) << endl;

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

  MinLCAProfiler<MinLCAVertexOrderSA<MinLCAGreedyNearest>>
      greedyNearest(g, 0, atoi(argv[3]));
  cout << "Creation elapsed time: " << greedyNearest.creationTime() << endl;
  greedyNearest.init(atoi(argv[4]), atoi(argv[5]), atoi(argv[6]), atof(argv[7]),
                     atoi(argv[8]));
  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;
  }
}