greedy_rnd_read_graph.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 <minlca/greedy-random.hh>
#include <cstdlib>
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;
  }

  readGraph(g, format, graphFile);

  int n = countNodes(g);
  int source = rand() % n;
  cout << "Source node: " << source << endl;
  cout << "Total nodes: " << n << endl;
  cout << "Total edges: " << countEdges(g) << endl;

  cout << endl;
  cout << "Using greedy nearest:" << endl;
  MinLCAGreedyNearestBfs<SmartGraph> greedyNearest(g);
  greedyNearest.init();
  greedyNearest.setSourceNode(g.nodeFromId(source));

  if (greedyNearest.run() == SOLUTION_FOUND) {
    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 nearest random:" << endl;
  MinLCAGreedyNearestRndBfs<SmartGraph> greedyNearestRnd(g, atoi(argv[4]));
  greedyNearestRnd.p(atof(argv[3]));
  greedyNearestRnd.seed(time(NULL));
  greedyNearestRnd.init();
  greedyNearestRnd.setSourceNode(g.nodeFromId(source));

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