compute_steiner.c

#include<scil/scil.h>
#include<scil/constraints/path.h>

using namespace SCIL;

void ComputeSteinerTree(graph& G, edge_array<double>& Cost, node r,
                        node_array<bool>& R, list<edge>& T) {

    cout<<"setupm\n";

  ILP_Problem IP(Optsense_Min);

  cout<<"setup problem\n";

  edge e=nil;
  var_map<edge> VM;
  forall_edges(e,G) { 
    //cout<<Cost[e]<<" cost\n";
    VM[e]=IP.add_variable(Cost[e], 0, 1, Vartype_Integer);
  }

  node u;
  forall_nodes(u, G) {
    if(R[u]) {
      IP.add_sym_constraint(new PATH(G, r, u, VM));
      row r;
      forall_in_edges(e,u) r+=(row) VM[e];
      IP.add_basic_constraint(r==1);
    } else if(u!=r) {
<<<<<<< compute_steiner.c
      row r;
      forall_in_edges(e, u) r+=(row) VM[e];
      forall_out_edges(e, u) r-=(row) VM[e];
      IP.add_basic_constraint(r<=0);
=======
       row r;
       forall_in_edges(e, u) r+=VM[e];
       forall_out_edges(e, u) r-=VM[e];
       IP.add_basic_constraint(r<=0);
>>>>>>> 1.2
    }
  }

  cout<<"start optimization\n";
  IP.optimize();
  
  forall_edges(e, G) {
    if(IP.get_solution(VM[e])==1) T.append(e);
  }
} // END_OF_COMPUTE_STEINER

---