| Line 79... |
Line 79... |
| 79 |
* growing algorithm. The resulting partition is returned in
|
79 |
* growing algorithm. The resulting partition is returned in
|
| 80 |
* graph->where
|
80 |
* graph->where
|
| 81 |
**************************************************************************/
|
81 |
**************************************************************************/
|
| 82 |
void GrowBisection(CtrlType *ctrl, GraphType *graph, int *tpwgts, float ubfactor)
|
82 |
void GrowBisection(CtrlType *ctrl, GraphType *graph, int *tpwgts, float ubfactor)
|
| 83 |
{
|
83 |
{
|
| 84 |
int i, j, k, nvtxs, drain, nleft, first, last, pwgts[2], minpwgt[2], maxpwgt[2], from, bestcut, icut, mincut, me, pass, nbfs;
|
84 |
int i, j, k, nvtxs, drain, nleft, first, last, pwgts[2], minpwgt[2], maxpwgt[2],
|
| - |
|
85 |
/* from, */bestcut/* , icut, mincut, me, pass */, nbfs;
|
| 85 |
idxtype *xadj, *vwgt, *adjncy, *adjwgt, *where;
|
86 |
idxtype *xadj, *vwgt, *adjncy, *adjwgt, *where;
|
| 86 |
idxtype *queue, *touched, *gain, *bestwhere;
|
87 |
idxtype *queue, *touched/* , *gain */, *bestwhere;
|
| 87 |
|
88 |
|
| 88 |
|
89 |
|
| 89 |
nvtxs = graph->nvtxs;
|
90 |
nvtxs = graph->nvtxs;
|
| 90 |
xadj = graph->xadj;
|
91 |
xadj = graph->xadj;
|
| 91 |
vwgt = graph->vwgt;
|
92 |
vwgt = graph->vwgt;
|
| Line 207... |
Line 208... |
| 207 |
* growing algorithm. The resulting partition is returned in
|
208 |
* growing algorithm. The resulting partition is returned in
|
| 208 |
* graph->where
|
209 |
* graph->where
|
| 209 |
**************************************************************************/
|
210 |
**************************************************************************/
|
| 210 |
void GrowBisectionNode(CtrlType *ctrl, GraphType *graph, float ubfactor)
|
211 |
void GrowBisectionNode(CtrlType *ctrl, GraphType *graph, float ubfactor)
|
| 211 |
{
|
212 |
{
|
| 212 |
int i, j, k, nvtxs, drain, nleft, first, last, pwgts[2], tpwgts[2], minpwgt[2], maxpwgt[2], from, bestcut, icut, mincut, me, pass, nbfs;
|
213 |
int i, j, k, nvtxs, drain, nleft, first, last, pwgts[2], tpwgts[2],
|
| - |
|
214 |
minpwgt[2], maxpwgt[2]/* , from */, bestcut/* , icut, mincut, me, pass */,
|
| - |
|
215 |
nbfs;
|
| 213 |
idxtype *xadj, *vwgt, *adjncy, *adjwgt, *where, *bndind;
|
216 |
idxtype *xadj, *vwgt, *adjncy, *adjwgt, *where, *bndind;
|
| 214 |
idxtype *queue, *touched, *gain, *bestwhere;
|
217 |
idxtype *queue, *touched/* , *gain */, *bestwhere;
|
| 215 |
|
218 |
|
| 216 |
nvtxs = graph->nvtxs;
|
219 |
nvtxs = graph->nvtxs;
|
| 217 |
xadj = graph->xadj;
|
220 |
xadj = graph->xadj;
|
| 218 |
vwgt = graph->vwgt;
|
221 |
vwgt = graph->vwgt;
|
| 219 |
adjncy = graph->adjncy;
|
222 |
adjncy = graph->adjncy;
|
| Line 343... |
Line 346... |
| 343 |
* growing algorithm. The resulting partition is returned in
|
346 |
* growing algorithm. The resulting partition is returned in
|
| 344 |
* graph->where
|
347 |
* graph->where
|
| 345 |
**************************************************************************/
|
348 |
**************************************************************************/
|
| 346 |
void RandomBisection(CtrlType *ctrl, GraphType *graph, int *tpwgts, float ubfactor)
|
349 |
void RandomBisection(CtrlType *ctrl, GraphType *graph, int *tpwgts, float ubfactor)
|
| 347 |
{
|
350 |
{
|
| 348 |
int i, ii, j, k, nvtxs, pwgts[2], minpwgt[2], maxpwgt[2], from, bestcut, icut, mincut, me, pass, nbfs;
|
351 |
int i, ii/* , j, k */, nvtxs, pwgts[2], minpwgt[2], maxpwgt[2],
|
| - |
|
352 |
/* from, */bestcut/* , icut, mincut, me, pass */, nbfs;
|
| 349 |
idxtype *xadj, *vwgt, *adjncy, *adjwgt, *where;
|
353 |
idxtype *xadj, *vwgt, *adjncy, *adjwgt, *where;
|
| 350 |
idxtype *perm, *bestwhere;
|
354 |
idxtype *perm, *bestwhere;
|
| 351 |
|
355 |
|
| 352 |
nvtxs = graph->nvtxs;
|
356 |
nvtxs = graph->nvtxs;
|
| 353 |
xadj = graph->xadj;
|
357 |
xadj = graph->xadj;
|
The R Project SVN
R-packages