<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>DSDP: examples/maxcut.c Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css"/>
</head>
<body>
<!-- Generated by Doxygen 1.7.4 -->
<div id="top">
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td style="padding-left: 0.5em;">
<div id="projectname">DSDP</div>
</td>
</tr>
</tbody>
</table>
</div>
<div id="navrow1" class="tabs">
<ul class="tablist">
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="pages.html"><span>Related Pages</span></a></li>
<li><a href="modules.html"><span>Modules</span></a></li>
<li><a href="annotated.html"><span>Data Structures</span></a></li>
<li class="current"><a href="files.html"><span>Files</span></a></li>
<li><a href="dirs.html"><span>Directories</span></a></li>
</ul>
</div>
<div id="navrow2" class="tabs2">
<ul class="tablist">
<li><a href="files.html"><span>File List</span></a></li>
<li><a href="globals.html"><span>Globals</span></a></li>
</ul>
</div>
<div id="nav-path" class="navpath">
<ul>
<li class="navelem"><a class="el" href="dir_0a4f0a65bb1e36a4913e16ae18cb477d.html">examples</a> </li>
</ul>
</div>
</div>
<div class="header">
<div class="headertitle">
<div class="title">maxcut.c</div> </div>
</div>
<div class="contents">
<a href="maxcut_8c.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="preprocessor">#include "<a class="code" href="dsdp5_8h.html" title="The API to DSDP for those applications using DSDP as a subroutine library.">dsdp5.h</a>"</span>
<a name="l00002"></a>00002 <span class="preprocessor">#include <string.h></span>
<a name="l00003"></a>00003 <span class="preprocessor">#include <math.h></span>
<a name="l00004"></a>00004 <span class="preprocessor">#include <stdio.h></span>
<a name="l00005"></a>00005 <span class="preprocessor">#include <stdlib.h></span>
<a name="l00012"></a>00012 <span class="keywordtype">char</span> help[]=<span class="stringliteral">"\</span>
<a name="l00013"></a>00013 <span class="stringliteral">DSDP Usage: maxcut <graph filename> \n\</span>
<a name="l00014"></a>00014 <span class="stringliteral"> -gaptol <relative duality gap: default is 0.001> \n\</span>
<a name="l00015"></a>00015 <span class="stringliteral"> -maxit <maximum iterates: default is 200> \n"</span>;
<a name="l00016"></a>00016
<a name="l00017"></a>00017 <span class="keyword">static</span> <span class="keywordtype">int</span> ReadGraph(<span class="keywordtype">char</span>*,<span class="keywordtype">int</span> *, <span class="keywordtype">int</span> *,<span class="keywordtype">int</span>**, <span class="keywordtype">int</span> **, <span class="keywordtype">double</span> **);
<a name="l00018"></a>00018 <span class="keyword">static</span> <span class="keywordtype">int</span> TCheckArgs(<a class="code" href="structDSDP__C.html" title="Internal structures for the DSDP solver.">DSDP</a>,<span class="keywordtype">int</span>,<span class="keywordtype">char</span> **);
<a name="l00019"></a>00019 <span class="keyword">static</span> <span class="keywordtype">int</span> ParseGraphline(<span class="keywordtype">char</span>*,<span class="keywordtype">int</span>*,<span class="keywordtype">int</span>*,<span class="keywordtype">double</span>*,<span class="keywordtype">int</span>*);
<a name="l00020"></a>00020 <span class="keywordtype">int</span> <a class="code" href="group__Examples.html#gae50b0d5b0ee972d30ec108351713e40b" title="Apply the Goemens and Williamson randomized cut algorithm to the SDP relaxation of the max-cut proble...">MaxCutRandomized</a>(<a class="code" href="structSDPCone__C.html" title="Internal structure for semidefinite cone.">SDPCone</a>,<span class="keywordtype">int</span>);
<a name="l00021"></a>00021 <span class="keywordtype">int</span> <a class="code" href="group__Examples.html#ga0609fc171fdb75bb66d16bb9e8cf4f00" title="Formulate and solve the SDP relaxation of the Maximum Cut problem.">MaxCut</a>(<span class="keywordtype">int</span>,<span class="keywordtype">int</span>, <span class="keywordtype">int</span>[], <span class="keywordtype">int</span>[], <span class="keywordtype">double</span>[]);
<a name="l00022"></a>00022
<a name="l00023"></a>00023
<a name="l00024"></a>00024 <span class="keywordtype">int</span> main(<span class="keywordtype">int</span> argc,<span class="keywordtype">char</span> *argv[]){
<a name="l00025"></a>00025 <span class="keywordtype">int</span> info;
<a name="l00026"></a>00026 <span class="keywordtype">int</span> *node1,*node2,nedges,nnodes;
<a name="l00027"></a>00027 <span class="keywordtype">double</span> *weight;
<a name="l00028"></a>00028
<a name="l00029"></a>00029 <span class="keywordflow">if</span> (argc<2){ printf(<span class="stringliteral">"%s"</span>,help); <span class="keywordflow">return</span>(1); }
<a name="l00030"></a>00030
<a name="l00031"></a>00031 info = ReadGraph(argv[1],&nnodes,&nedges,&node1,&node2,&weight);
<a name="l00032"></a>00032 <span class="keywordflow">if</span> (info){ printf(<span class="stringliteral">"Problem reading file\n"</span>); <span class="keywordflow">return</span> 1; }
<a name="l00033"></a>00033
<a name="l00034"></a>00034 <a class="code" href="group__Examples.html#ga0609fc171fdb75bb66d16bb9e8cf4f00" title="Formulate and solve the SDP relaxation of the Maximum Cut problem.">MaxCut</a>(nnodes,nedges,node1,node2,weight);
<a name="l00035"></a>00035
<a name="l00036"></a>00036 free(node1);free(node2);free(weight);
<a name="l00037"></a>00037 <span class="keywordflow">return</span> 0;
<a name="l00038"></a>00038 }
<a name="l00039"></a>00039
<a name="l00051"></a><a class="code" href="group__Examples.html#ga0609fc171fdb75bb66d16bb9e8cf4f00">00051</a> <span class="keywordtype">int</span> <a class="code" href="group__Examples.html#ga0609fc171fdb75bb66d16bb9e8cf4f00" title="Formulate and solve the SDP relaxation of the Maximum Cut problem.">MaxCut</a>(<span class="keywordtype">int</span> nnodes,<span class="keywordtype">int</span> nedges, <span class="keywordtype">int</span> node1[], <span class="keywordtype">int</span> node2[], <span class="keywordtype">double</span> weight[]){
<a name="l00052"></a>00052
<a name="l00053"></a>00053 <span class="keywordtype">int</span> i,info;
<a name="l00054"></a>00054 <span class="keywordtype">int</span> *indd,*iptr;
<a name="l00055"></a>00055 <span class="keywordtype">double</span> *yy,*val,*diag,tval=0;
<a name="l00056"></a>00056 <a class="code" href="dsdpbasictypes_8h.html#a2a68c4cccb1289043bf9b59a58f55b3a" title="There are many reasons to terminate the solver.">DSDPTerminationReason</a> reason;
<a name="l00057"></a>00057 <a class="code" href="structSDPCone__C.html" title="Internal structure for semidefinite cone.">SDPCone</a> sdpcone;
<a name="l00058"></a>00058 <a class="code" href="structDSDP__C.html" title="Internal structures for the DSDP solver.">DSDP</a> dsdp;
<a name="l00059"></a>00059
<a name="l00060"></a>00060 info = <a class="code" href="group__DSDPBasic.html#gaa32509ded8359326d02782adb91c745a" title="Create a DSDP solver. FIRST DSDP routine!">DSDPCreate</a>(nnodes,&dsdp);
<a name="l00061"></a>00061 info = DSDPCreateSDPCone(dsdp,1,&sdpcone);
<a name="l00062"></a>00062
<a name="l00063"></a>00063 <span class="keywordflow">if</span> (info){ printf(<span class="stringliteral">"Out of memory\n"</span>); <span class="keywordflow">return</span> 1; }
<a name="l00064"></a>00064
<a name="l00065"></a>00065 info = <a class="code" href="group__SDPRoutines.html#ga0c3a5c6eee6aca0ab0c222fbfcca1d19" title="Set the dimension of one block in the semidefinite cone.">SDPConeSetBlockSize</a>(sdpcone,0,nnodes);
<a name="l00066"></a>00066
<a name="l00067"></a>00067
<a name="l00068"></a>00068 <span class="comment">/* Formulate the problem from the data */</span>
<a name="l00069"></a>00069 <span class="comment">/* </span>
<a name="l00070"></a>00070 <span class="comment"> Diagonal elements equal 1.0 </span>
<a name="l00071"></a>00071 <span class="comment"> Create Constraint matrix A_i for i=1, ..., nnodes.</span>
<a name="l00072"></a>00072 <span class="comment"> that has a single nonzero element.</span>
<a name="l00073"></a>00073 <span class="comment"> */</span>
<a name="l00074"></a>00074 diag=(<span class="keywordtype">double</span>*)malloc(nnodes*<span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));
<a name="l00075"></a>00075 iptr=(<span class="keywordtype">int</span>*)malloc(nnodes*<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>));
<a name="l00076"></a>00076 <span class="keywordflow">for</span> (i=0;i<nnodes;i++){
<a name="l00077"></a>00077 iptr[i]=i*(i+1)/2+i;
<a name="l00078"></a>00078 diag[i]=1.0;
<a name="l00079"></a>00079 }
<a name="l00080"></a>00080
<a name="l00081"></a>00081 <span class="keywordflow">for</span> (i=0;i<nnodes;i++){
<a name="l00082"></a>00082 info = <a class="code" href="group__DSDPBasic.html#ga7e1b78dc7d7407fcf84e05b9c42fc72c" title="Set the objective vector b in (D).">DSDPSetDualObjective</a>(dsdp,i+1,1.0);
<a name="l00083"></a>00083 info = <a class="code" href="group__SDPBasic.html#gaa6ed45b2539266f04bd4b8401aa89c06" title="Set data matrix in a sparse format.">SDPConeSetASparseVecMat</a>(sdpcone,0,i+1,nnodes,1.0,0,iptr+i,diag+i,1);
<a name="l00084"></a>00084 <span class="keywordflow">if</span> (0==1){
<a name="l00085"></a>00085 printf(<span class="stringliteral">"Matrix: %d\n"</span>,i+1);
<a name="l00086"></a>00086 info = <a class="code" href="group__SDPBasic.html#ga66567faeecc4cb75f7ae3a3eed966bd4" title="Print a data matrix to the screen.">SDPConeViewDataMatrix</a>(sdpcone,0,i+1);
<a name="l00087"></a>00087 }
<a name="l00088"></a>00088 }
<a name="l00089"></a>00089
<a name="l00090"></a>00090 <span class="comment">/* C matrix is the Laplacian of the adjacency matrix */</span>
<a name="l00091"></a>00091 <span class="comment">/* Also compute a feasible initial point y such that S>=0 */</span>
<a name="l00092"></a>00092 yy=(<span class="keywordtype">double</span>*)malloc(nnodes*<span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));
<a name="l00093"></a>00093 <span class="keywordflow">for</span> (i=0;i<nnodes;i++){yy[i]=0.0;}
<a name="l00094"></a>00094 indd=(<span class="keywordtype">int</span>*)malloc((nnodes+nedges)*<span class="keyword">sizeof</span>(int));
<a name="l00095"></a>00095 val=(<span class="keywordtype">double</span>*)malloc((nnodes+nedges)*<span class="keyword">sizeof</span>(double));
<a name="l00096"></a>00096 <span class="keywordflow">for</span> (i=0;i<nnodes+nedges;i++){indd[i]=0;}
<a name="l00097"></a>00097 <span class="keywordflow">for</span> (i=0;i<nnodes;i++){indd[nedges+i]=i*(i+1)/2+i;}
<a name="l00098"></a>00098 <span class="keywordflow">for</span> (i=0;i<nnodes+nedges;i++){val[i]=0;}
<a name="l00099"></a>00099 <span class="keywordflow">for</span> (i=0;i<nedges;i++){
<a name="l00100"></a>00100 indd[i]=(node1[i])*(node1[i]+1)/2 + node2[i];
<a name="l00101"></a>00101 tval+=fabs(weight[i]);
<a name="l00102"></a>00102 val[i]=weight[i]/4;
<a name="l00103"></a>00103 val[nedges+node1[i]]-=weight[i]/4;
<a name="l00104"></a>00104 val[nedges+node2[i]]-=weight[i]/4;
<a name="l00105"></a>00105 yy[node1[i]]-= fabs(weight[i]/2);
<a name="l00106"></a>00106 yy[node2[i]]-= fabs(weight[i]/2);
<a name="l00107"></a>00107 }
<a name="l00108"></a>00108
<a name="l00109"></a>00109 <span class="keywordflow">if</span> (0){
<a name="l00110"></a>00110 info = <a class="code" href="group__SDPBasic.html#gaa6ed45b2539266f04bd4b8401aa89c06" title="Set data matrix in a sparse format.">SDPConeSetASparseVecMat</a>(sdpcone,0,0,nnodes,1.0,0,indd,val,nedges+nnodes);
<a name="l00111"></a>00111 } <span class="keywordflow">else</span> { <span class="comment">/* Equivalent */</span>
<a name="l00112"></a>00112 info = <a class="code" href="group__SDPBasic.html#gaa6ed45b2539266f04bd4b8401aa89c06" title="Set data matrix in a sparse format.">SDPConeSetASparseVecMat</a>(sdpcone,0,0,nnodes,1.0,0,indd,val,nedges);
<a name="l00113"></a>00113 info = <a class="code" href="group__SDPData.html#ga16ceede5a0ddb2717ca40ffe2a5f3d2f" title="Add data matrix in a sparse format.">SDPConeAddASparseVecMat</a>(sdpcone,0,0,nnodes,1.0,0,indd+nedges,val+nedges,nnodes);
<a name="l00114"></a>00114 }
<a name="l00115"></a>00115 <span class="keywordflow">if</span> (0==1){ info = <a class="code" href="group__SDPBasic.html#ga66567faeecc4cb75f7ae3a3eed966bd4" title="Print a data matrix to the screen.">SDPConeViewDataMatrix</a>(sdpcone,0,0);}
<a name="l00116"></a>00116
<a name="l00117"></a>00117 <span class="comment">/* Initial Point */</span>
<a name="l00118"></a>00118 info = <a class="code" href="group__DSDPSolution.html#ga846e363115b1fba5622306efc2e0ba38" title="Set an initial value for the variable r in (DD)">DSDPSetR0</a>(dsdp,0.0);
<a name="l00119"></a>00119 info = <a class="code" href="group__DSDPSolver.html#ga2795069b8aaa6551a8c1c248bbb2cb1a" title="Set an upper bound on the objective value at the solution.">DSDPSetZBar</a>(dsdp,10*tval+1.0);
<a name="l00120"></a>00120 <span class="keywordflow">for</span> (i=0;i<nnodes; i++){
<a name="l00121"></a>00121 info = <a class="code" href="group__DSDPSolution.html#gacf5a2bd7ecb03b319caa22e545ef8e01" title="Set the initial values of variables y in (D).">DSDPSetY0</a>(dsdp,i+1,10*yy[i]);
<a name="l00122"></a>00122 }
<a name="l00123"></a>00123 <span class="keywordflow">if</span> (info) <span class="keywordflow">return</span> info;
<a name="l00124"></a>00124
<a name="l00125"></a>00125 <span class="comment">/* Get read to go */</span>
<a name="l00126"></a>00126 info=<a class="code" href="group__DSDPConverge.html#ga4c0fa6941c40cca7643c2f4a9ae813bf" title="Terminate the solver when the relative duality gap is less than this tolerance.">DSDPSetGapTolerance</a>(dsdp,0.001);
<a name="l00127"></a>00127 info=<a class="code" href="group__DSDPSolver.html#ga5d737fca8ae872f57fd37cc7784feede" title="Set the potential parameter.">DSDPSetPotentialParameter</a>(dsdp,5);
<a name="l00128"></a>00128 info=<a class="code" href="group__DSDPSolver.html#ga903ff948f2ba766430ba3918b9447ee7" title="Reuse the Hessian of the barrier function multiple times at each DSDP iteration.">DSDPReuseMatrix</a>(dsdp,0);
<a name="l00129"></a>00129 info=<a class="code" href="group__DSDPConverge.html#ga56d725fd1a7e14c5294cb292c998193e" title="Terminate the solver when the relative duality gap is suffiently small and the PNorm is less than thi...">DSDPSetPNormTolerance</a>(dsdp,1.0);
<a name="l00130"></a>00130 <span class="comment">/*</span>
<a name="l00131"></a>00131 <span class="comment"> info = TCheckArgs(dsdp,argc,argv);</span>
<a name="l00132"></a>00132 <span class="comment"> */</span>
<a name="l00133"></a>00133
<a name="l00134"></a>00134 <span class="keywordflow">if</span> (info){ printf(<span class="stringliteral">"Out of memory\n"</span>); <span class="keywordflow">return</span> 1; }
<a name="l00135"></a>00135 info = <a class="code" href="group__DSDPBasic.html#ga945023e6d663d0897d3d04a7d738608d" title="Print at every kth iteration.">DSDPSetStandardMonitor</a>(dsdp,1);
<a name="l00136"></a>00136
<a name="l00137"></a>00137 info = <a class="code" href="group__DSDPBasic.html#ga2bd311ea1ecad8f690255b8a35f694a0" title="Set up data structures in the solver and the cones associated with it.">DSDPSetup</a>(dsdp);
<a name="l00138"></a>00138 <span class="keywordflow">if</span> (info){ printf(<span class="stringliteral">"Out of memory\n"</span>); <span class="keywordflow">return</span> 1; }
<a name="l00139"></a>00139
<a name="l00140"></a>00140 info = <a class="code" href="group__DSDPBasic.html#gabf7f1440bad5dd2a609288912743c8e9" title="Apply DSDP to the problem.">DSDPSolve</a>(dsdp);
<a name="l00141"></a>00141 <span class="keywordflow">if</span> (info){ printf(<span class="stringliteral">"Numerical error\n"</span>); <span class="keywordflow">return</span> 1; }
<a name="l00142"></a>00142 info = <a class="code" href="group__DSDPConverge.html#ga637bf541e030c5aef4d436a9792714a2" title="Copy the reason why the solver terminated.">DSDPStopReason</a>(dsdp,&reason);
<a name="l00143"></a>00143
<a name="l00144"></a>00144 <span class="keywordflow">if</span> (reason!=<a class="code" href="dsdpbasictypes_8h.html#a2a68c4cccb1289043bf9b59a58f55b3aa7f8800e949dce9fa0f5e41b9bca69e02">DSDP_INFEASIBLE_START</a>){ <span class="comment">/* Randomized solution strategy */</span>
<a name="l00145"></a>00145 info=<a class="code" href="group__Examples.html#gae50b0d5b0ee972d30ec108351713e40b" title="Apply the Goemens and Williamson randomized cut algorithm to the SDP relaxation of the max-cut proble...">MaxCutRandomized</a>(sdpcone,nnodes);
<a name="l00146"></a>00146 <span class="keywordflow">if</span> (0==1){ <span class="comment">/* Look at the solution */</span>
<a name="l00147"></a>00147 <span class="keywordtype">int</span> n; <span class="keywordtype">double</span> *xx,*y=diag;
<a name="l00148"></a>00148 info=<a class="code" href="group__DSDPBasic.html#ga816a784dde863f6a35a2f5d8786a3441" title="Copies the variables y into an array.">DSDPGetY</a>(dsdp,y,nnodes);
<a name="l00149"></a>00149 info=<a class="code" href="group__DSDPBasic.html#gacd271769549030ce365597101946220b" title="Compute the X variables.">DSDPComputeX</a>(dsdp);DSDPCHKERR(info);
<a name="l00150"></a>00150 info=<a class="code" href="group__SDPBasic.html#ga9e7744a5c7fbe87642979e2b41bc2c00" title="After applying the solver, set a pointer to the array in the object with the solution X...">SDPConeGetXArray</a>(sdpcone,0,&xx,&n);
<a name="l00151"></a>00151 }
<a name="l00152"></a>00152 }
<a name="l00153"></a>00153 info = <a class="code" href="group__DSDPBasic.html#ga3242b32d5e9c5e5358da5f79ae5d08dd" title="Free the internal data structures of the solver and the cones associated with it.">DSDPDestroy</a>(dsdp);
<a name="l00154"></a>00154
<a name="l00155"></a>00155 free(iptr);
<a name="l00156"></a>00156 free(yy);
<a name="l00157"></a>00157 free(indd);
<a name="l00158"></a>00158 free(val);
<a name="l00159"></a>00159 free(diag);
<a name="l00160"></a>00160
<a name="l00161"></a>00161 <span class="keywordflow">return</span> 0;
<a name="l00162"></a>00162 } <span class="comment">/* main */</span>
<a name="l00163"></a>00163
<a name="l00164"></a>00164
<a name="l00165"></a>00165
<a name="l00175"></a><a class="code" href="group__Examples.html#gae50b0d5b0ee972d30ec108351713e40b">00175</a> <span class="keywordtype">int</span> <a class="code" href="group__Examples.html#gae50b0d5b0ee972d30ec108351713e40b" title="Apply the Goemens and Williamson randomized cut algorithm to the SDP relaxation of the max-cut proble...">MaxCutRandomized</a>(<a class="code" href="structSDPCone__C.html" title="Internal structure for semidefinite cone.">SDPCone</a> sdpcone,<span class="keywordtype">int</span> nnodes){
<a name="l00176"></a>00176 <span class="keywordtype">int</span> i,j,derror,info;
<a name="l00177"></a>00177 <span class="keywordtype">double</span> dd,scal=RAND_MAX,*vv,*tt,*cc,ymin=0;
<a name="l00178"></a>00178
<a name="l00179"></a>00179 vv=(<span class="keywordtype">double</span>*)malloc(nnodes*<span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));
<a name="l00180"></a>00180 tt=(<span class="keywordtype">double</span>*)malloc(nnodes*<span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));
<a name="l00181"></a>00181 cc=(<span class="keywordtype">double</span>*)malloc((nnodes+2)*<span class="keyword">sizeof</span>(double));
<a name="l00182"></a>00182 info=<a class="code" href="group__SDPRoutines.html#ga274b127d17d7dec0dc4b0ca499f13e89" title="Compute a factor V such that .">SDPConeComputeXV</a>(sdpcone,0,&derror);
<a name="l00183"></a>00183 <span class="keywordflow">for</span> (i=0;i<nnodes;i++){
<a name="l00184"></a>00184 <span class="keywordflow">for</span> (j=0;j<nnodes;j++){dd = (( rand())/scal - .5); vv[j] = tan(3.1415926*dd);}
<a name="l00185"></a>00185 info=<a class="code" href="group__SDPRoutines.html#ga288158182d952a72534b9c8894407c5b" title="Multiply an array by a factor V such that .">SDPConeXVMultiply</a>(sdpcone,0,vv,tt,nnodes);
<a name="l00186"></a>00186 <span class="keywordflow">for</span> (j=0;j<nnodes;j++){<span class="keywordflow">if</span> (tt[j]<0) tt[j]=-1; <span class="keywordflow">else</span> tt[j]=1;}
<a name="l00187"></a>00187 <span class="keywordflow">for</span> (j=0;j<nnodes+2;j++){cc[j]=0;}
<a name="l00188"></a>00188 info=<a class="code" href="group__SDPRoutines.html#ga521bba9ef443933ea8748aa1e7f8d142" title="Compute for i = 0 through m.">SDPConeAddXVAV</a>(sdpcone,0,tt,nnodes,cc,nnodes+2);
<a name="l00189"></a>00189 <span class="keywordflow">if</span> (cc[0]<ymin) ymin=cc[0];
<a name="l00190"></a>00190 }
<a name="l00191"></a>00191 printf(<span class="stringliteral">"Best integer solution: %4.2f\n"</span>,ymin);
<a name="l00192"></a>00192 free(vv); free(tt); free(cc);
<a name="l00193"></a>00193
<a name="l00194"></a>00194 <span class="keywordflow">return</span>(0);
<a name="l00195"></a>00195 }
<a name="l00196"></a>00196
<a name="l00197"></a>00197 <span class="keyword">static</span> <span class="keywordtype">int</span> TCheckArgs(<a class="code" href="structDSDP__C.html" title="Internal structures for the DSDP solver.">DSDP</a> dsdp,<span class="keywordtype">int</span> nargs,<span class="keywordtype">char</span> *runargs[]){
<a name="l00198"></a>00198
<a name="l00199"></a>00199 <span class="keywordtype">int</span> kk, info;
<a name="l00200"></a>00200
<a name="l00201"></a>00201 info=<a class="code" href="group__DSDPBasic.html#ga5f1941aaedfa888e940bad968ac0d847" title="Read command line arguments to set options in DSDP.">DSDPSetOptions</a>(dsdp,runargs,nargs);
<a name="l00202"></a>00202 <span class="keywordflow">for</span> (kk=1; kk<nargs-1; kk++){
<a name="l00203"></a>00203 <span class="keywordflow">if</span> (strncmp(runargs[kk],<span class="stringliteral">"-dloginfo"</span>,8)==0){
<a name="l00204"></a>00204 info=DSDPLogInfoAllow(<a class="code" href="dsdpbasictypes_8h.html#ae667f2bff3ab5ab0bc109fa76dc4ed65ae6b2e53e51e94a5fa7204ceac78f824f">DSDP_TRUE</a>,0);
<a name="l00205"></a>00205 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (strncmp(runargs[kk],<span class="stringliteral">"-params"</span>,7)==0){
<a name="l00206"></a>00206 info=<a class="code" href="group__DSDPSolver.html#gab1340aac2a0c79108be725389f481979" title="Read DSDP parameters from a file.">DSDPReadOptions</a>(dsdp,runargs[kk+1]);
<a name="l00207"></a>00207 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (strncmp(runargs[kk],<span class="stringliteral">"-help"</span>,7)==0){
<a name="l00208"></a>00208 printf(<span class="stringliteral">"%s\n"</span>,help);
<a name="l00209"></a>00209 }
<a name="l00210"></a>00210 }
<a name="l00211"></a>00211
<a name="l00212"></a>00212 <span class="keywordflow">return</span> 0;
<a name="l00213"></a>00213 }
<a name="l00214"></a>00214
<a name="l00215"></a>00215
<a name="l00216"></a>00216 <span class="preprocessor">#define BUFFERSIZ 100</span>
<a name="l00217"></a>00217 <span class="preprocessor"></span>
<a name="l00218"></a>00218 <span class="preprocessor">#undef __FUNCT__ </span>
<a name="l00219"></a>00219 <span class="preprocessor"></span><span class="preprocessor">#define __FUNCT__ "ParseGraphline"</span>
<a name="l00220"></a>00220 <span class="preprocessor"></span><span class="keyword">static</span> <span class="keywordtype">int</span> ParseGraphline(<span class="keywordtype">char</span> * thisline,<span class="keywordtype">int</span> *row,<span class="keywordtype">int</span> *col,<span class="keywordtype">double</span> *value,
<a name="l00221"></a>00221 <span class="keywordtype">int</span> *gotem){
<a name="l00222"></a>00222
<a name="l00223"></a>00223 <span class="keywordtype">int</span> temp;
<a name="l00224"></a>00224 <span class="keywordtype">int</span> rtmp,coltmp;
<a name="l00225"></a>00225
<a name="l00226"></a>00226 rtmp=-1, coltmp=-1, *value=0.0;
<a name="l00227"></a>00227 temp=sscanf(thisline,<span class="stringliteral">"%d %d %lf"</span>,&rtmp,&coltmp,value);
<a name="l00228"></a>00228 <span class="keywordflow">if</span> (temp==3 && rtmp>0 && coltmp>0) *gotem=3;
<a name="l00229"></a>00229 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (temp==2 && rtmp>0 && coltmp>0){ *value = 1.0; *gotem=3;}
<a name="l00230"></a>00230 <span class="keywordflow">else</span> *gotem=0;
<a name="l00231"></a>00231 *row=rtmp-1; *col=coltmp-1;
<a name="l00232"></a>00232
<a name="l00233"></a>00233 <span class="keywordflow">return</span>(0);
<a name="l00234"></a>00234 }
<a name="l00235"></a>00235
<a name="l00236"></a>00236
<a name="l00237"></a>00237 <span class="preprocessor">#undef __FUNCT__ </span>
<a name="l00238"></a>00238 <span class="preprocessor"></span><span class="preprocessor">#define __FUNCT__ "ReadGraph"</span>
<a name="l00239"></a>00239 <span class="preprocessor"></span><span class="keywordtype">int</span> ReadGraph(<span class="keywordtype">char</span>* filename,<span class="keywordtype">int</span> *nnodes, <span class="keywordtype">int</span> *nedges,
<a name="l00240"></a>00240 <span class="keywordtype">int</span>**n1, <span class="keywordtype">int</span> ** n2, <span class="keywordtype">double</span> **wght){
<a name="l00241"></a>00241
<a name="l00242"></a>00242 FILE*fp;
<a name="l00243"></a>00243 <span class="keywordtype">char</span> thisline[BUFFERSIZ]=<span class="stringliteral">"*"</span>;
<a name="l00244"></a>00244 <span class="keywordtype">int</span> i,k=0,line=0,nodes,edges,gotone=3;
<a name="l00245"></a>00245 <span class="keywordtype">int</span> *node1,*node2;
<a name="l00246"></a>00246 <span class="keywordtype">double</span> *weight;
<a name="l00247"></a>00247 <span class="keywordtype">int</span> info,row,col;
<a name="l00248"></a>00248 <span class="keywordtype">double</span> value;
<a name="l00249"></a>00249
<a name="l00250"></a>00250 fp=fopen(filename,<span class="stringliteral">"r"</span>);
<a name="l00251"></a>00251 <span class="keywordflow">if</span> (!fp){printf(<span class="stringliteral">"Cannot open file %s !"</span>,filename);<span class="keywordflow">return</span>(1);}
<a name="l00252"></a>00252
<a name="l00253"></a>00253 <span class="keywordflow">while</span>(!feof(fp) && (thisline[0] == <span class="charliteral">'*'</span> || thisline[0] == <span class="charliteral">'"'</span>) ){
<a name="l00254"></a>00254 fgets(thisline,BUFFERSIZ,fp); line++;
<a name="l00255"></a>00255 }
<a name="l00256"></a>00256
<a name="l00257"></a>00257 <span class="keywordflow">if</span> (sscanf(thisline,<span class="stringliteral">"%d %d"</span>,&nodes, &edges)!=2){
<a name="l00258"></a>00258 printf(<span class="stringliteral">"First line must contain the number of nodes and number of edges\n"</span>);
<a name="l00259"></a>00259 <span class="keywordflow">return</span> 1;
<a name="l00260"></a>00260 }
<a name="l00261"></a>00261
<a name="l00262"></a>00262 node1=(<span class="keywordtype">int</span>*)malloc(edges*<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>));
<a name="l00263"></a>00263 node2=(<span class="keywordtype">int</span>*)malloc(edges*<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>));
<a name="l00264"></a>00264 weight=(<span class="keywordtype">double</span>*)malloc(edges*<span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));
<a name="l00265"></a>00265
<a name="l00266"></a>00266 <span class="keywordflow">for</span> (i=0; i<edges; i++){ node1[i]=0;node2[i]=0;weight[i]=0.0;}
<a name="l00267"></a>00267
<a name="l00268"></a>00268 <span class="keywordflow">while</span>(!feof(fp) && gotone){
<a name="l00269"></a>00269 thisline[0]=<span class="charliteral">'\0'</span>;
<a name="l00270"></a>00270 fgets(thisline,BUFFERSIZ,fp); line++;
<a name="l00271"></a>00271 info = ParseGraphline(thisline,&row,&col,&value,&gotone);
<a name="l00272"></a>00272 <span class="keywordflow">if</span> (gotone && value!=0.0 && k<edges &&
<a name="l00273"></a>00273 col < nodes && row < nodes && col >= 0 && row >= 0){
<a name="l00274"></a>00274 <span class="keywordflow">if</span> (row<col){info=row;row=col;col=info;}
<a name="l00275"></a>00275 <span class="keywordflow">if</span> (row == col){}
<a name="l00276"></a>00276 <span class="keywordflow">else</span> {
<a name="l00277"></a>00277 node1[k]=row; node2[k]=col;
<a name="l00278"></a>00278 weight[k]=value; k++;
<a name="l00279"></a>00279 }
<a name="l00280"></a>00280 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (gotone && k>=edges) {
<a name="l00281"></a>00281 printf(<span class="stringliteral">"To many edges in file.\nLine %d, %s\n"</span>,line,thisline);
<a name="l00282"></a>00282 <span class="keywordflow">return</span> 1;
<a name="l00283"></a>00283 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (gotone&&(col >= nodes || row >= nodes || col < 0 || row < 0)){
<a name="l00284"></a>00284 printf(<span class="stringliteral">"Invalid node number.\nLine %d, %s\n"</span>,line,thisline);
<a name="l00285"></a>00285 <span class="keywordflow">return</span> 1;
<a name="l00286"></a>00286 }
<a name="l00287"></a>00287 }
<a name="l00288"></a>00288 *nnodes=nodes; *nedges=edges;
<a name="l00289"></a>00289 *n1=node1; *n2=node2; *wght=weight;
<a name="l00290"></a>00290 <span class="keywordflow">return</span> 0;
<a name="l00291"></a>00291 }
</pre></div></div>
</div>
<hr class="footer"/><address class="footer"><small>Generated on Wed Jun 8 2011 for DSDP by 
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.4 </small></address>
</body>
</html>
