56 Graph(
const int n_v0,
const int n_e0,
const int* e0)
57 : n_v(n_v0), n_e(n_e0), e(e0) {}
60 const int e_20_10[] = {
61 0, 4, 2,12, 12,14, 18,19, 7,10,
62 9,12, 5,11, 6,15, 3,18, 7,16
65 const Graph g_20_10(20,10,e_20_10);
67 const int e_40_20[] = {
68 21,30, 11,30, 19,38, 20,25, 11,24,
69 20,33, 8,39, 4, 5, 6,16, 5,32,
70 0, 9, 5,24, 25,28, 36,38, 14,20,
71 19,25, 11,22, 13,30, 7,36, 15,33
74 const Graph g_40_20(40, 20, e_40_20);
96 g(
opt.
size() == 0 ? g_20_10 : g_40_20),
97 v(*this,g.n_v,0,1), k(*this,0,g.n_v) {
99 for (
int i = g.
n_e;
i--; ) {
100 const int* e1 = e++;
const int* e2 = e++;
109 v.update(*
this, share, s.
v);
115 return new IndSet(share,*
this);
120 os <<
"\tk = " << k << std::endl
121 <<
"\tv[] = " <<
v << std::endl;
140 IntMaximizeScript::run<IndSet,BAB,SizeOptions>(
opt);