int n=xj.find("mX")->second.size();

double fi=2-(((double)n)/2);

cout << "fi:"<<fi<<"\n";

return fi;

There is only one constraint which is adding a node j to the node i if the state value of node i is greater than 10.

If the constraint is not verified, a maximum time step is computed to forseen when the next constraint at the node i will appear.
The test function of the constraint is:

bool v=false;

double x_value=xi.find("mX")->second;

if (x_value>=10) {

v=true;

cout << "constraint verified ! \n";

} else {

int n=xj.find("mX")->second.size();

double fi=2-(((double)n)/2);

double dx=10-x_value;

if (fi>0) dt=dx/fi;

cout << "constraint unverified !\n";

}

return v;

xi=8;

xj=2;