#include "BCP_math.hpp"
#include "BCP_solution.hpp"
#include "MCF1_tm.hpp"

using std::make_pair;

//#############################################################################

void
MCF1_tm::init_new_phase(int phase,
			BCP_column_generation& colgen,
			CoinSearchTreeBase*& candidates)
{
  // Let BCP initialize things (like creating the search tree)
  BCP_tm_user::init_new_phase(phase, colgen, candidates);
  // but override colgen
  colgen = BCP_GenerateColumns;
}

/*---------------------------------------------------------------------------*/

void MCF1_tm::initialize_core(BCP_vec<BCP_var_core*>& vars,
			      BCP_vec<BCP_cut_core*>& cuts,
			      BCP_lp_relax*& matrix)
{
  int i;
  // The core cuts are the cuts that specify that the sum of the flows must
  // not be out of bounds, and the convexity constraints for the generated
  // algo variables (flows). However, since there are no core variables, the
  // core matrix is empty.
  for (int i = 0; i < data.numarcs; ++i) {
    cuts.push_back(new BCP_cut_core(-BCP_DBL_MAX, data.arcs[i].ub));
  }
  for (i = 0; i < data.numcommodities; ++i) {
    cuts.push_back(new BCP_cut_core(1.0, 1.0));
  }
  matrix = new BCP_lp_relax;
}

/*---------------------------------------------------------------------------*/

void MCF1_tm::create_root(BCP_vec<BCP_var*>& added_vars,
			  BCP_vec<BCP_cut*>& added_cuts,
			  BCP_user_data*& user_data)
{
  // create a column (a flow) for each commodity
  if (par.entry(MCF1_par::AddDummySourceSinkArcs)) {
    // In this case just send all the demand through the artificial arc
    // for each commodity. That'll get the algorithm started.
    for (int i = 0; i < data.numcommodities; ++i) {
      int ind = data.numarcs-data.numcommodities+i;
      double val = data.commodities[i].demand;
      double w = data.commodities[i].demand * data.arcs[ind].weight;
      added_vars.push_back(new MCF1_var(i, CoinPackedVector(1, &ind, &val,
							    false), w));
    }
  } else {
    // Generate a flow for each commodity independently
    // *** excercise ***

    // Think of the consequences of not having the artificial arcs. After
    // branching the master problem may become infeasible, subproblems can
    // be infeasible, etc...
  }
}

/*---------------------------------------------------------------------------*/

void MCF1_tm::display_feasible_solution(const BCP_solution* sol)
{
  const BCP_solution_generic* gsol =
    dynamic_cast<const BCP_solution_generic*>(sol);
  const BCP_vec<BCP_var*>& vars = gsol->_vars;
  for (int i = vars.size()-1; i >= 0; --i) {
    const MCF1_var* v = dynamic_cast<const MCF1_var*>(vars[i]);
    printf("Flow of commodity %i:\n", v->commodity);
    const CoinPackedVector& f = v->flow;
    const int* ind = f.getIndices();
    const double* val = f.getElements();
    for (int j = 0; j < f.getNumElements(); ++j) {
      printf("    arc %6i  ( %5i -> %5i )     flow %i\n",
	     ind[j], data.arcs[ind[j]].tail, data.arcs[ind[j]].head,
	     static_cast<int>(val[j]));
    }
  }
}

/*---------------------------------------------------------------------------*/

void MCF1_tm::pack_module_data(BCP_buffer& buf, BCP_process_t ptype)
{
  switch (ptype) {
  case BCP_ProcessType_LP:
    par.pack(buf);
    data.pack(buf);
    break;
  default:
    throw BCP_fatal_error("In this example we have only an LP process!\n");
  }
}		
