#include <iostream>

 #include <fstream>

 #include <list_graph.h>

 #include <hugo/dimacs.h>

 #include <hugo/time_measure.h>

 #include "minlengthpaths.h"

 //#include <time_measure.h>

 using namespace hugo;

 // Use a DIMACS max flow file as stdin.

 // read_dimacs_demo < dimacs_max_flow_file

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

   typedef ListGraph Graph;

   typedef Graph::Node Node;

   //typedef Graph::EachEdgeIt EachEdgeIt;

   Graph G;

   Node s, t;

   Graph::EdgeMap<int> cap(G);

   readDimacs(std::cin, G, cap, s, t);

   std::cout << "Minlengthpaths demo (ATHOS)..." << std::endl;

   //Graph::EdgeMap<int> flow(G); //0 flow

   //  double pre_time=currTime();

   int k=1;

   if (argc>1)

     k = atoi(argv[1]);

   MinLengthPaths<Graph, Graph::EdgeMap<int> >

     surb_test(G,cap);

   Timer ts;

   ts.reset();

   std::cout << "Number of found paths: " << surb_test.run(s,t,k) << std::endl;

   std::cout << "elapsed time: " << ts << std::endl;

   std::cout << "Total length of found paths: " << surb_test.totalLength() << std::endl;

   //std::cout << (surb_test.checkComplementarySlackness() ? "OK (compl. slackn.)." : "Problem (compl. slackn.)!!!") << std::endl;

   //preflow_push<Graph, int> max_flow_test(G, s, t, cap);

   //int flow_value=max_flow_test.run();

   //double post_time=currTime();

   //std::cout << "elapsed time: " << post_time-pre_time << " sec"<< std::endl; 

   //std::cout << "flow value: "<< flow_value << std::endl;

   return 0;

 }