+ /*
+ * Those fields are the top level description of the platform furnished in the xml file.
+ */
+ flows = xbt_swag_size(&(sys->variable_set));
+ links = xbt_swag_size(&(sys->active_constraint_set));
+
+ /*
+ * This number is found based on the tree structure explained on top.
+ */
+ K = (int)log((double)flows)/log(2.0);
+
+ /*
+ * The number of variables in the SDP style.
+ */
+ nb_var = get_y(K, pow(2,K));
+
+ /*
+ * Find the size of each group of constraints.
+ */
+ nb_cnsts_capacity = links + ((int)pow(2,K)) - flows;
+ nb_cnsts_struct = (int)pow(2,K) - 1;
+ nb_cnsts_positivy = (int)pow(2,K);
+
+ /*
+ * The total number of constraints.
+ */
+ nb_cnsts = nb_cnsts_capacity + nb_cnsts_struct + nb_cnsts_positivy;
+
+
+ /*
+ * Keep track of which blocks have off diagonal entries.
+ */
+ isdiag=(int *)calloc((nb_cnsts+1), sizeof(int));
+ for (i=1; i<=nb_cnsts; i++)
+ isdiag[i]=1;
+
+ C.nblocks = nb_cnsts;
+ C.blocks = (struct blockrec *) calloc((C.nblocks+1),sizeof(struct blockrec));
+ constraints = (struct constraintmatrix *)calloc((nb_var+1),sizeof(struct constraintmatrix));
+
+ for(i = 1; i <= nb_var; i++){
+ constraints[i].blocks=NULL;
+ }
+
+ a = (double *)calloc(nb_var+1, sizeof(double));
+
+ /*
+ * Block sizes.
+ */
+ block_num=1;
+ block_size=0;
+
+ /*
+ * For each constraint block do.
+ */
+ for(i = 1; i <= nb_cnsts; i++){
+
+ /*
+ * Structured blocks are size 2 and all others are size 1.
+ */
+ if(i <= nb_cnsts_struct){
+ block_size = 2;
+ fprintf(sdpout,"2 ");
+ }else{
+ block_size = 1;
+ fprintf(sdpout,"1 ");
+ }
+
+ /*
+ * All blocks are matrices.
+ */
+ C.blocks[block_num].blockcategory = MATRIX;
+ C.blocks[block_num].blocksize = block_size;
+ C.blocks[block_num].data.mat = (double *)calloc(block_size * block_size, sizeof(double));
+
+ block_num++;
+ }
+
+ fprintf(sdpout,"\n");
+
+
+ /*
+ * Creates de objective function array.
+ */
+ a = (double *)calloc((nb_var+1), sizeof(double));
+
+ for(i = 1; i <= nb_var; i++){
+ if(get_y(0,1)==i){
+ fprintf(sdpout,"-1 ");
+ a[i]=-1;
+ }else{
+ fprintf(sdpout,"0 ");
+ a[i]=0;
+ }
+ }
+ fprintf(sdpout,"\n");
+
+
+ /*
+ * Structure contraint blocks.
+ */
+ block_num = 1;
+ matno = 1;
+ for(k = 1; k <= K; k++){
+ for(i = 1; i <= pow(2,k-1); i++){
+ matno=get_y(k,2*i-1);
+ fprintf(sdpout,"%d %d 1 1 1\n", matno , block_num);
+ addentry(constraints, &C, matno, block_num, 1, 1, 1.0, C.blocks[block_num].blocksize);
+
+ matno=get_y(k,2*i);
+ fprintf(sdpout,"%d %d 2 2 1\n", matno , block_num);
+ addentry(constraints, &C, matno, block_num, 2, 2, 1.0, C.blocks[block_num].blocksize);
+
+ matno=get_y(k-1,i);
+ fprintf(sdpout,"%d %d 1 2 1\n", matno , block_num);
+ addentry(constraints, &C, matno, block_num, 1, 2, 1.0, C.blocks[block_num].blocksize);
+
+ matno=get_y(k-1,i);
+ fprintf(sdpout,"%d %d 2 1 1\n", matno , block_num);
+ addentry(constraints, &C, matno, block_num, 2, 1, 1.0, C.blocks[block_num].blocksize);
+
+ isdiag[block_num] = 0;
+ block_num++;
+ }
+ }
+
+
+
+