<!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/color.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">color.c</div> </div>
</div>
<div class="contents">
<a href="color_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="l00006"></a>00006
<a name="l00012"></a>00012 <span class="keywordtype">char</span> help2[]=<span class="stringliteral">"\nA positive semidefinite relaxation of the\n\</span>
<a name="l00013"></a>00013 <span class="stringliteral">graph k coloring problem can be rewritten as\n\n\</span>
<a name="l00014"></a>00014 <span class="stringliteral"> Find X>=0 \n\</span>
<a name="l00015"></a>00015 <span class="stringliteral"> such that X_ij <= 1 - 1/(k-1) for all edges (i,j).\n\</span>
<a name="l00016"></a>00016 <span class="stringliteral">"</span>;
<a name="l00017"></a>00017
<a name="l00018"></a>00018 <span class="keywordtype">char</span> help[]=<span class="stringliteral">"DSDP Usage: color <graph filename> "</span>;
<a name="l00019"></a>00019
<a name="l00020"></a>00020 <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="l00021"></a>00021 <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="l00022"></a>00022 <span class="keyword">static</span> <span class="keywordtype">int</span> RandomizedColor(<a class="code" href="structDSDP__C.html" title="Internal structures for the DSDP solver.">DSDP</a>, <a class="code" href="structSDPCone__C.html" title="Internal structure for semidefinite cone.">SDPCone</a>, <span class="keywordtype">int</span>, <span class="keywordtype">int</span>[], <span class="keywordtype">int</span>[], <span class="keywordtype">int</span>);
<a name="l00023"></a>00023 <span class="keywordtype">int</span> <a class="code" href="group__Examples.html#ga4c0434f83e3905e00528dac73f2e862d" title="SDP relaxation of k-coloring problem.">MinColoring</a>(<span class="keywordtype">int</span> argc,<span class="keywordtype">char</span> *argv[]);
<a name="l00024"></a>00024
<a name="l00025"></a>00025
<a name="l00026"></a>00026 <span class="keywordtype">int</span> main(<span class="keywordtype">int</span> argc,<span class="keywordtype">char</span> *argv[]){
<a name="l00027"></a>00027 <span class="keywordtype">int</span> info;
<a name="l00028"></a>00028 info=<a class="code" href="group__Examples.html#ga4c0434f83e3905e00528dac73f2e862d" title="SDP relaxation of k-coloring problem.">MinColoring</a>(argc,argv);
<a name="l00029"></a>00029 <span class="keywordflow">return</span> 0;
<a name="l00030"></a>00030 }
<a name="l00031"></a>00031
<a name="l00039"></a><a class="code" href="group__Examples.html#ga4c0434f83e3905e00528dac73f2e862d">00039</a> <span class="keywordtype">int</span> <a class="code" href="group__Examples.html#ga4c0434f83e3905e00528dac73f2e862d" title="SDP relaxation of k-coloring problem.">MinColoring</a>(<span class="keywordtype">int</span> argc,<span class="keywordtype">char</span> *argv[]){
<a name="l00040"></a>00040
<a name="l00041"></a>00041 <span class="keywordtype">int</span> i,kk,vari,info;
<a name="l00042"></a>00042 <span class="keywordtype">int</span> *node1,*node2,nedges,nnodes;
<a name="l00043"></a>00043 <span class="keywordtype">int</span> *iptr1,*iptr2;
<a name="l00044"></a>00044 <span class="keywordtype">double</span> *weight,*yy1,*yy2,bb;
<a name="l00045"></a>00045 <a class="code" href="dsdpbasictypes_8h.html#a2a68c4cccb1289043bf9b59a58f55b3a" title="There are many reasons to terminate the solver.">DSDPTerminationReason</a> reason;
<a name="l00046"></a>00046 <a class="code" href="structSDPCone__C.html" title="Internal structure for semidefinite cone.">SDPCone</a> sdpcone;
<a name="l00047"></a>00047 <a class="code" href="dsdp5_8h.html#a266598a85e3c9c12e8706e21cf7f0f45" title="The BCone object points to lower and upper bounds on the variable y in (D).">BCone</a> bcone;
<a name="l00048"></a>00048 <a class="code" href="structDSDP__C.html" title="Internal structures for the DSDP solver.">DSDP</a> dsdp;
<a name="l00049"></a>00049
<a name="l00050"></a>00050 <span class="keywordflow">if</span> (argc<2){ printf(<span class="stringliteral">"%s\n%s"</span>,help2,help); <span class="keywordflow">return</span>(1); }
<a name="l00051"></a>00051
<a name="l00052"></a>00052 info = ReadGraph(argv[1],&nnodes,&nedges,&node1,&node2,&weight);
<a name="l00053"></a>00053 <span class="keywordflow">if</span> (info){ printf(<span class="stringliteral">"Problem reading file\n"</span>); <span class="keywordflow">return</span> 1; }
<a name="l00054"></a>00054
<a name="l00055"></a>00055 info = <a class="code" href="group__DSDPBasic.html#gaa32509ded8359326d02782adb91c745a" title="Create a DSDP solver. FIRST DSDP routine!">DSDPCreate</a>(nnodes+nedges,&dsdp);
<a name="l00056"></a>00056
<a name="l00057"></a>00057 info = DSDPCreateSDPCone(dsdp,1,&sdpcone);
<a name="l00058"></a>00058 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="l00059"></a>00059 info = <a class="code" href="group__SDPRoutines.html#ga40728695e4c841900c02c615a8d96ab0" title="Set the number of nonzero matrices in a block of the semidefinite cone.">SDPConeSetSparsity</a>(sdpcone,0,nnodes+nedges+1);
<a name="l00060"></a>00060
<a name="l00061"></a>00061 info = <a class="code" href="group__Bounds.html#ga66c37f394d6efb45e686aed600015d09" title="Create a new cone that represents bounds on the y variables.">DSDPCreateBCone</a>(dsdp,&bcone);
<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
<a name="l00066"></a>00066 <span class="comment">/* Formulate the problem from the data */</span>
<a name="l00067"></a>00067 <span class="comment">/* Create data matrices */</span>
<a name="l00068"></a>00068
<a name="l00069"></a>00069 <span class="comment">/* Diagonal elements of X(i,i) must equal 1.0 */</span>
<a name="l00070"></a>00070 iptr1=(<span class="keywordtype">int</span>*)malloc(nnodes*<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>));
<a name="l00071"></a>00071 yy1=(<span class="keywordtype">double</span>*)malloc(nnodes*<span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));
<a name="l00072"></a>00072 <span class="keywordflow">for</span> (i=0;i<nnodes;i++){
<a name="l00073"></a>00073 iptr1[i]=(i+2)*(i+1)/2-1;
<a name="l00074"></a>00074 yy1[i]=1.0;
<a name="l00075"></a>00075 }
<a name="l00076"></a>00076 <span class="keywordflow">for</span> (i=0;i<nnodes;i++){
<a name="l00077"></a>00077 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,iptr1+i,yy1+i,1);
<a name="l00078"></a>00078 <span class="keywordflow">if</span> (info) printf(<span class="stringliteral">"ERROR 1: %d \n"</span>,i);
<a name="l00079"></a>00079 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="l00080"></a>00080 }
<a name="l00081"></a>00081
<a name="l00082"></a>00082 <span class="comment">/* For each nonzero element (i,j) of the matrix, X(i,j) must be less than 1 - 1/nnodes */</span>
<a name="l00083"></a>00083 bb=2-2.0/nnodes;
<a name="l00084"></a>00084 iptr2=(<span class="keywordtype">int</span>*)malloc(nedges*<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>));
<a name="l00085"></a>00085 yy2=(<span class="keywordtype">double</span>*)malloc(nedges*<span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));
<a name="l00086"></a>00086 <span class="keywordflow">for</span> (i=0;i<nedges;i++){
<a name="l00087"></a>00087 iptr2[i]=(node1[i])*(node1[i]+1)/2+node2[i];
<a name="l00088"></a>00088 yy2[i]=1.0;
<a name="l00089"></a>00089 }
<a name="l00090"></a>00090 info = <a class="code" href="group__Bounds.html#gade1222d9b36e71a1b9a97fb7ffc07e76" title="Set a surplus variable in constraint in (P).">BConeAllocateBounds</a>(bcone,nedges);
<a name="l00091"></a>00091 <span class="keywordflow">for</span> (i=0; i<nedges; i++){
<a name="l00092"></a>00092 vari=nnodes+i+1;
<a name="l00093"></a>00093 info = SDPConeSetSparseVecMat(sdpcone,0,vari,nnodes,0,iptr2+i,yy2+i,1);
<a name="l00094"></a>00094 <span class="keywordflow">if</span> (info) printf(<span class="stringliteral">"ERROR 2: %d %d \n"</span>,i,vari);
<a name="l00095"></a>00095 info = <a class="code" href="group__Bounds.html#gae139bf5bb64763263a3605f97d4f5526" title="Set a slack variable to a constraint in (P).">BConeSetPSlackVariable</a>(bcone,vari);
<a name="l00096"></a>00096 <span class="keywordflow">if</span> (info) printf(<span class="stringliteral">"ERROR 3: %d %d \n"</span>,i,vari);
<a name="l00097"></a>00097 info = <a class="code" href="group__DSDPBasic.html#ga7e1b78dc7d7407fcf84e05b9c42fc72c" title="Set the objective vector b in (D).">DSDPSetDualObjective</a>(dsdp,vari,bb);
<a name="l00098"></a>00098 }
<a name="l00099"></a>00099
<a name="l00100"></a>00100
<a name="l00101"></a>00101 <span class="comment">/* Get read to go */</span>
<a name="l00102"></a>00102 info=<a class="code" href="group__DSDPSolver.html#ga5d737fca8ae872f57fd37cc7784feede" title="Set the potential parameter.">DSDPSetPotentialParameter</a>(dsdp,5);
<a name="l00103"></a>00103
<a name="l00104"></a>00104 <span class="keywordflow">for</span> (kk=1; kk<argc-1; kk++){
<a name="l00105"></a>00105 <span class="keywordflow">if</span> (strncmp(argv[kk],<span class="stringliteral">"-dloginfo"</span>,8)==0){
<a name="l00106"></a>00106 info=DSDPLogInfoAllow(<a class="code" href="dsdpbasictypes_8h.html#ae667f2bff3ab5ab0bc109fa76dc4ed65ae6b2e53e51e94a5fa7204ceac78f824f">DSDP_TRUE</a>,0);
<a name="l00107"></a>00107 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (strncmp(argv[kk],<span class="stringliteral">"-params"</span>,7)==0){
<a name="l00108"></a>00108 info=<a class="code" href="group__DSDPSolver.html#gab1340aac2a0c79108be725389f481979" title="Read DSDP parameters from a file.">DSDPReadOptions</a>(dsdp,argv[kk+1]);
<a name="l00109"></a>00109 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (strncmp(argv[kk],<span class="stringliteral">"-help"</span>,7)==0){
<a name="l00110"></a>00110 printf(<span class="stringliteral">"%s\n"</span>,help);
<a name="l00111"></a>00111 }
<a name="l00112"></a>00112 }
<a name="l00113"></a>00113 info=<a class="code" href="group__DSDPBasic.html#ga5f1941aaedfa888e940bad968ac0d847" title="Read command line arguments to set options in DSDP.">DSDPSetOptions</a>(dsdp,argv,argc);
<a name="l00114"></a>00114
<a name="l00115"></a>00115 <span class="keywordflow">if</span> (info){ printf(<span class="stringliteral">"Out of memory\n"</span>); <span class="keywordflow">return</span> 1; }
<a name="l00116"></a>00116 info = <a class="code" href="group__DSDPBasic.html#ga945023e6d663d0897d3d04a7d738608d" title="Print at every kth iteration.">DSDPSetStandardMonitor</a>(dsdp,1);
<a name="l00117"></a>00117
<a name="l00118"></a>00118 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="l00119"></a>00119 <span class="keywordflow">if</span> (info){ printf(<span class="stringliteral">"Out of memory\n"</span>); <span class="keywordflow">return</span> 1; }
<a name="l00120"></a>00120
<a name="l00121"></a>00121 info = <a class="code" href="group__DSDPBasic.html#gabf7f1440bad5dd2a609288912743c8e9" title="Apply DSDP to the problem.">DSDPSolve</a>(dsdp);
<a name="l00122"></a>00122 <span class="keywordflow">if</span> (info){ printf(<span class="stringliteral">"Numerical error\n"</span>); <span class="keywordflow">return</span> 1; }
<a name="l00123"></a>00123 info = <a class="code" href="group__DSDPConverge.html#ga637bf541e030c5aef4d436a9792714a2" title="Copy the reason why the solver terminated.">DSDPStopReason</a>(dsdp,&reason);
<a name="l00124"></a>00124
<a name="l00125"></a>00125 <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="l00126"></a>00126 info=RandomizedColor(dsdp, sdpcone, nnodes, node1, node2, nedges);
<a name="l00127"></a>00127 }
<a name="l00128"></a>00128
<a name="l00129"></a>00129 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="l00130"></a>00130
<a name="l00131"></a>00131 free(node1);free(node2);free(weight);
<a name="l00132"></a>00132 free(iptr1);
<a name="l00133"></a>00133 free(yy1);
<a name="l00134"></a>00134 free(iptr2);
<a name="l00135"></a>00135 free(yy2);
<a name="l00136"></a>00136
<a name="l00137"></a>00137 <span class="keywordflow">return</span> 0;
<a name="l00138"></a>00138 }
<a name="l00139"></a>00139
<a name="l00140"></a>00140 <span class="keyword">static</span> <span class="keywordtype">int</span> GetXRow(<span class="keywordtype">double</span> xmat[],<span class="keywordtype">double</span> xrow[],<span class="keywordtype">int</span> row,<span class="keywordtype">int</span> n){
<a name="l00141"></a>00141 <span class="keywordtype">int</span> i,i1=row*(row+1)/2;
<a name="l00142"></a>00142 <span class="keywordflow">for</span> (i=0;i<row;i++){xrow[i]=xmat[i1+i];}
<a name="l00143"></a>00143 <span class="keywordflow">for</span> (i=row;i<n;i++){xrow[i]=xmat[i1+row];i1+=i+1;}
<a name="l00144"></a>00144 <span class="keywordflow">return</span> 0;
<a name="l00145"></a>00145 }
<a name="l00146"></a>00146
<a name="l00147"></a>00147 <span class="keyword">typedef</span> <span class="keyword">struct </span>{
<a name="l00148"></a>00148 <span class="keywordtype">int</span> index;<span class="keywordtype">double</span> val;
<a name="l00149"></a>00149 } orderVec;
<a name="l00150"></a>00150
<a name="l00151"></a>00151 <span class="keyword">static</span> <span class="keywordtype">int</span> cut_comp(<span class="keyword">const</span> <span class="keywordtype">void</span> *e1,<span class="keyword">const</span> <span class="keywordtype">void</span> *e2){ <span class="comment">/* Used in qsort routine */</span>
<a name="l00152"></a>00152 <span class="keywordtype">double</span> d1=((orderVec*)e1)->val, d2=((orderVec*)e2)->val;
<a name="l00153"></a>00153 <span class="keywordflow">if</span> (d1<d2) <span class="keywordflow">return</span> (1);
<a name="l00154"></a>00154 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (d1>d2) <span class="keywordflow">return</span> (-1);
<a name="l00155"></a>00155 <span class="keywordflow">return</span>(0);
<a name="l00156"></a>00156 }
<a name="l00157"></a>00157
<a name="l00158"></a>00158 <span class="keyword">static</span> <span class="keywordtype">int</span> RemoveNode(<span class="keywordtype">int</span> node, <span class="keywordtype">int</span> node1[], <span class="keywordtype">int</span> node2[], <span class="keywordtype">int</span> *nedges){
<a name="l00159"></a>00159 <span class="keywordtype">int</span> i,nnedges=*nedges;
<a name="l00160"></a>00160 <span class="keywordflow">for</span> (i=0;i<nnedges;i++){
<a name="l00161"></a>00161 <span class="keywordflow">if</span> (node1[i]==node || node2[i]==node){
<a name="l00162"></a>00162 node1[i]=node1[nnedges-1];
<a name="l00163"></a>00163 node2[i]=node2[nnedges-1];
<a name="l00164"></a>00164 nnedges--;
<a name="l00165"></a>00165 <span class="keywordflow">if</span> (i < nnedges) i--;
<a name="l00166"></a>00166 }
<a name="l00167"></a>00167 }
<a name="l00168"></a>00168 *nedges=nnedges;
<a name="l00169"></a>00169 <span class="keywordflow">return</span> 0;
<a name="l00170"></a>00170 }
<a name="l00171"></a>00171
<a name="l00172"></a>00172 <span class="keyword">static</span> <span class="keywordtype">int</span> Connected(<span class="keywordtype">int</span> n1, <span class="keywordtype">int</span> n2, <span class="keywordtype">int</span> node1[], <span class="keywordtype">int</span> node2[], <span class="keywordtype">int</span> nedges){
<a name="l00173"></a>00173 <span class="keywordtype">int</span> i;
<a name="l00174"></a>00174 <span class="keywordflow">if</span> (n1==n2) <span class="keywordflow">return</span> 1;
<a name="l00175"></a>00175 <span class="keywordflow">for</span> (i=0;i<nedges;i++){
<a name="l00176"></a>00176 <span class="keywordflow">if</span> (node1[i]==n1 && node2[i]==n2){ <span class="keywordflow">return</span> 1;}
<a name="l00177"></a>00177 <span class="keywordflow">if</span> (node1[i]==n2 && node2[i]==n1){ <span class="keywordflow">return</span> 1;}
<a name="l00178"></a>00178 }
<a name="l00179"></a>00179 <span class="keywordflow">return</span> 0;
<a name="l00180"></a>00180 }
<a name="l00181"></a>00181
<a name="l00182"></a>00182 <span class="keyword">static</span> <span class="keywordtype">int</span> HighDegree(<span class="keywordtype">int</span> node1[], <span class="keywordtype">int</span> node2[], <span class="keywordtype">int</span> nedges, <span class="keywordtype">int</span> iwork[], <span class="keywordtype">int</span> nnodes){
<a name="l00183"></a>00183 <span class="keywordtype">int</span> i,nmax=0,maxdegree=-1;
<a name="l00184"></a>00184 <span class="keywordflow">for</span> (i=0;i<nnodes;i++) iwork[i]=0;
<a name="l00185"></a>00185 <span class="keywordflow">for</span> (i=0;i<nedges;i++){
<a name="l00186"></a>00186 iwork[node1[i]]++; iwork[node2[i]]++;
<a name="l00187"></a>00187 }
<a name="l00188"></a>00188 <span class="keywordflow">for</span> (i=0;i<nnodes;i++){ <span class="keywordflow">if</span> (iwork[i]>maxdegree){nmax=i; maxdegree=iwork[i];} }
<a name="l00189"></a>00189 <span class="keywordflow">return</span> nmax;
<a name="l00190"></a>00190 }
<a name="l00191"></a>00191
<a name="l00192"></a>00192 <span class="keyword">static</span> <span class="keywordtype">int</span> First(<span class="keywordtype">int</span> coloring[], <span class="keywordtype">int</span> nnodes){
<a name="l00193"></a>00193 <span class="keywordtype">int</span> i,nmax=nnodes;
<a name="l00194"></a>00194 <span class="keywordflow">for</span> (i=0;i<nnodes;i++){
<a name="l00195"></a>00195 <span class="keywordflow">if</span> (coloring[i]==0){
<a name="l00196"></a>00196 nmax=i; <span class="keywordflow">return</span> nmax;
<a name="l00197"></a>00197 }
<a name="l00198"></a>00198 }
<a name="l00199"></a>00199 <span class="keywordflow">return</span> -1;
<a name="l00200"></a>00200 }
<a name="l00201"></a>00201
<a name="l00202"></a>00202 <span class="keyword">static</span> <span class="keywordtype">int</span> RandomizedColor(<a class="code" href="structDSDP__C.html" title="Internal structures for the DSDP solver.">DSDP</a> dsdp, <a class="code" href="structSDPCone__C.html" title="Internal structure for semidefinite cone.">SDPCone</a> sdpcone, <span class="keywordtype">int</span> nnodes, <span class="keywordtype">int</span> node1[], <span class="keywordtype">int</span> node2[], <span class="keywordtype">int</span> nedges){
<a name="l00203"></a>00203 <span class="keywordtype">int</span> i,j,nodek,nn,info,flag,coloring=0,maxvertex;
<a name="l00204"></a>00204 <span class="keywordtype">int</span> *degree,*color,*cgroup,ngsize,uncolored=nnodes;
<a name="l00205"></a>00205 <span class="keywordtype">int</span> tnedges=nedges;
<a name="l00206"></a>00206 <span class="keywordtype">double</span> *xrow,*xptr;
<a name="l00207"></a>00207 orderVec *vorder;
<a name="l00208"></a>00208
<a name="l00209"></a>00209 xrow=(<span class="keywordtype">double</span>*)malloc(nnodes*<span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));
<a name="l00210"></a>00210 color=(<span class="keywordtype">int</span>*)malloc(nnodes*<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>));
<a name="l00211"></a>00211 cgroup=(<span class="keywordtype">int</span>*)malloc(nnodes*<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>));
<a name="l00212"></a>00212 degree=(<span class="keywordtype">int</span>*)malloc(nnodes*<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>));
<a name="l00213"></a>00213 vorder=(orderVec*)malloc(nnodes*<span class="keyword">sizeof</span>(orderVec));
<a name="l00214"></a>00214
<a name="l00215"></a>00215 <span class="keywordflow">for</span> (i=0;i<nnodes;i++){ color[i]=0;}
<a name="l00216"></a>00216 info=<a class="code" href="group__DSDPBasic.html#gacd271769549030ce365597101946220b" title="Compute the X variables.">DSDPComputeX</a>(dsdp);
<a name="l00217"></a>00217 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,&xptr,&nn);
<a name="l00218"></a>00218
<a name="l00219"></a>00219 <span class="keywordflow">while</span> (uncolored>0){
<a name="l00220"></a>00220
<a name="l00221"></a>00221 coloring++;
<a name="l00222"></a>00222
<a name="l00223"></a>00223 maxvertex=First(color,nnodes);
<a name="l00224"></a>00224 maxvertex=HighDegree(node1,node2,tnedges,degree,nnodes);
<a name="l00225"></a>00225
<a name="l00226"></a>00226 cgroup[0]=maxvertex;ngsize=1;
<a name="l00227"></a>00227
<a name="l00228"></a>00228 info=GetXRow(xptr,xrow,maxvertex,nnodes);
<a name="l00229"></a>00229
<a name="l00230"></a>00230 <span class="keywordflow">for</span> (i=0;i<nnodes;i++){vorder[i].index=i; vorder[i].val = xrow[i];}
<a name="l00231"></a>00231 qsort( (<span class="keywordtype">void</span>*)vorder, nnodes, <span class="keyword">sizeof</span>(orderVec), cut_comp);
<a name="l00232"></a>00232
<a name="l00233"></a>00233 <span class="keywordflow">for</span> (i=0;i<nnodes;i++){
<a name="l00234"></a>00234 nodek=vorder[i].index;
<a name="l00235"></a>00235 <span class="keywordflow">if</span> (color[nodek]==0){
<a name="l00236"></a>00236 <span class="keywordflow">for</span> (flag=0,j=0;j<ngsize;j++){
<a name="l00237"></a>00237 <span class="keywordflow">if</span> (Connected(nodek,cgroup[j],node1,node2,tnedges) ){flag=1;}
<a name="l00238"></a>00238 }
<a name="l00239"></a>00239 <span class="keywordflow">if</span> (flag==0){ cgroup[ngsize]=nodek; ngsize++; }
<a name="l00240"></a>00240 }
<a name="l00241"></a>00241 }
<a name="l00242"></a>00242 <span class="keywordflow">for</span> (i=0;i<ngsize;i++){
<a name="l00243"></a>00243 color[cgroup[i]]=coloring; uncolored--;
<a name="l00244"></a>00244 RemoveNode(cgroup[i],node1,node2,&tnedges);
<a name="l00245"></a>00245 }
<a name="l00246"></a>00246 }
<a name="l00247"></a>00247 printf(<span class="stringliteral">"\nCOLORS: %d\n"</span>,coloring);
<a name="l00248"></a>00248 free(xrow);
<a name="l00249"></a>00249 free(color);
<a name="l00250"></a>00250 free(cgroup);
<a name="l00251"></a>00251 free(degree);
<a name="l00252"></a>00252 free(vorder);
<a name="l00253"></a>00253 <span class="keywordflow">return</span>(0);
<a name="l00254"></a>00254 }
<a name="l00255"></a>00255
<a name="l00256"></a>00256
<a name="l00257"></a>00257 <span class="preprocessor">#define BUFFERSIZ 100</span>
<a name="l00258"></a>00258 <span class="preprocessor"></span>
<a name="l00259"></a>00259 <span class="preprocessor">#undef __FUNCT__ </span>
<a name="l00260"></a>00260 <span class="preprocessor"></span><span class="preprocessor">#define __FUNCT__ "ParseGraphline"</span>
<a name="l00261"></a>00261 <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="l00262"></a>00262 <span class="keywordtype">int</span> *gotem){
<a name="l00263"></a>00263
<a name="l00264"></a>00264 <span class="keywordtype">int</span> temp;
<a name="l00265"></a>00265 <span class="keywordtype">int</span> rtmp,coltmp;
<a name="l00266"></a>00266
<a name="l00267"></a>00267 rtmp=-1, coltmp=-1, *value=0.0;
<a name="l00268"></a>00268 temp=sscanf(thisline,<span class="stringliteral">"%d %d %lf"</span>,&rtmp,&coltmp,value);
<a name="l00269"></a>00269 <span class="keywordflow">if</span> (temp==3 && rtmp>0 && coltmp>0) *gotem=3;
<a name="l00270"></a>00270 <span class="keywordflow">else</span> <span class="keywordflow">if</span> (temp==2 && rtmp>0 && coltmp>0){ *value = 1.0; *gotem=3;}
<a name="l00271"></a>00271 <span class="keywordflow">else</span> *gotem=0;
<a name="l00272"></a>00272 *row=rtmp-1; *col=coltmp-1;
<a name="l00273"></a>00273
<a name="l00274"></a>00274 <span class="keywordflow">return</span>(0);
<a name="l00275"></a>00275 }
<a name="l00276"></a>00276
<a name="l00277"></a>00277
<a name="l00278"></a>00278 <span class="preprocessor">#undef __FUNCT__ </span>
<a name="l00279"></a>00279 <span class="preprocessor"></span><span class="preprocessor">#define __FUNCT__ "ReadGraph"</span>
<a name="l00280"></a>00280 <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="l00281"></a>00281 <span class="keywordtype">int</span>**n1, <span class="keywordtype">int</span> ** n2, <span class="keywordtype">double</span> **wght){
<a name="l00282"></a>00282
<a name="l00283"></a>00283 FILE*fp;
<a name="l00284"></a>00284 <span class="keywordtype">char</span> thisline[BUFFERSIZ]=<span class="stringliteral">"*"</span>;
<a name="l00285"></a>00285 <span class="keywordtype">int</span> i,k=0,line=0,nodes,edges,gotone=3;
<a name="l00286"></a>00286 <span class="keywordtype">int</span> *node1,*node2;
<a name="l00287"></a>00287 <span class="keywordtype">double</span> *weight;
<a name="l00288"></a>00288 <span class="keywordtype">int</span> info,row,col;
<a name="l00289"></a>00289 <span class="keywordtype">double</span> value;
<a name="l00290"></a>00290
<a name="l00291"></a>00291 fp=fopen(filename,<span class="stringliteral">"r"</span>);
<a name="l00292"></a>00292 <span class="keywordflow">if</span> (!fp){printf(<span class="stringliteral">"Cannot open file %s !"</span>,filename);<span class="keywordflow">return</span>(1);}
<a name="l00293"></a>00293
<a name="l00294"></a>00294 <span class="keywordflow">while</span>(!feof(fp) && (thisline[0] == <span class="charliteral">'*'</span> || thisline[0] == <span class="charliteral">'"'</span>) ){
<a name="l00295"></a>00295 fgets(thisline,BUFFERSIZ,fp); line++;
<a name="l00296"></a>00296 }
<a name="l00297"></a>00297
<a name="l00298"></a>00298 <span class="keywordflow">if</span> (sscanf(thisline,<span class="stringliteral">"%d %d"</span>,&nodes, &edges)!=2){
<a name="l00299"></a>00299 printf(<span class="stringliteral">"First line must contain the number of nodes and number of edges\n"</span>);
<a name="l00300"></a>00300 <span class="keywordflow">return</span> 1;
<a name="l00301"></a>00301 }
<a name="l00302"></a>00302
<a name="l00303"></a>00303 node1=(<span class="keywordtype">int</span>*)malloc(edges*<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>));
<a name="l00304"></a>00304 node2=(<span class="keywordtype">int</span>*)malloc(edges*<span class="keyword">sizeof</span>(<span class="keywordtype">int</span>));
<a name="l00305"></a>00305 weight=(<span class="keywordtype">double</span>*)malloc(edges*<span class="keyword">sizeof</span>(<span class="keywordtype">double</span>));
<a name="l00306"></a>00306
<a name="l00307"></a>00307 <span class="keywordflow">for</span> (i=0; i<edges; i++){ node1[i]=0;node2[i]=0;weight[i]=0.0;}
<a name="l00308"></a>00308
<a name="l00309"></a>00309 <span class="keywordflow">while</span>(!feof(fp) && gotone){
<a name="l00310"></a>00310 thisline[0]=<span class="charliteral">'\0'</span>;
<a name="l00311"></a>00311 fgets(thisline,BUFFERSIZ,fp); line++;
<a name="l00312"></a>00312 info = ParseGraphline(thisline,&row,&col,&value,&gotone);
<a name="l00313"></a>00313 <span class="keywordflow">if</span> (gotone && value!=0.0 && k<edges &&
<a name="l00314"></a>00314 col < nodes && row < nodes && col >= 0 && row >= 0){
<a name="l00315"></a>00315 <span class="keywordflow">if</span> (row<col){info=row;row=col;col=info;}
<a name="l00316"></a>00316 <span class="keywordflow">if</span> (row == col){}
<a name="l00317"></a>00317 <span class="keywordflow">else</span> {
<a name="l00318"></a>00318 node1[k]=row; node2[k]=col;
<a name="l00319"></a>00319 weight[k]=value; k++;
<a name="l00320"></a>00320 }
<a name="l00321"></a>00321 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (gotone && k>=edges) {
<a name="l00322"></a>00322 printf(<span class="stringliteral">"To many edges in file.\nLine %d, %s\n"</span>,line,thisline);
<a name="l00323"></a>00323 <span class="keywordflow">return</span> 1;
<a name="l00324"></a>00324 } <span class="keywordflow">else</span> <span class="keywordflow">if</span> (gotone&&(col >= nodes || row >= nodes || col < 0 || row < 0)){
<a name="l00325"></a>00325 printf(<span class="stringliteral">"Invalid node number.\nLine %d, %s\n"</span>,line,thisline);
<a name="l00326"></a>00326 <span class="keywordflow">return</span> 1;
<a name="l00327"></a>00327 }
<a name="l00328"></a>00328 }
<a name="l00329"></a>00329 *nnodes=nodes; *nedges=edges;
<a name="l00330"></a>00330 *n1=node1; *n2=node2; *wght=weight;
<a name="l00331"></a>00331 <span class="keywordflow">return</span> 0;
<a name="l00332"></a>00332 }
</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>
