The R Project SVN R-packages

Rev

Rev 155 | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 155 Rev 1128
Line 135... Line 135...
135
/*************************************************************************
135
/*************************************************************************
136
* This function adds a node of certain gain into a partition
136
* This function adds a node of certain gain into a partition
137
**************************************************************************/
137
**************************************************************************/
138
int PQueueInsert(PQueueType *queue, int node, int gain)
138
int PQueueInsert(PQueueType *queue, int node, int gain)
139
{
139
{
140
  int i, j, k;
140
  int i, j/* , k */;
141
  idxtype *locator;
141
  idxtype *locator;
142
  ListNodeType *newnode;
142
  ListNodeType *newnode;
143
  KeyValueType *heap;
143
  KeyValueType *heap;
144
 
144
 
145
  if (queue->type == 1) {
145
  if (queue->type == 1) {
Line 292... Line 292...
292
**************************************************************************/
292
**************************************************************************/
293
int PQueueUpdate(PQueueType *queue, int node, int oldgain, int newgain)
293
int PQueueUpdate(PQueueType *queue, int node, int oldgain, int newgain)
294
{
294
{
295
  int i, j;
295
  int i, j;
296
  idxtype *locator;
296
  idxtype *locator;
297
  ListNodeType *newnode;
297
/*   ListNodeType *newnode; */
298
  KeyValueType *heap;
298
  KeyValueType *heap;
299
 
299
 
300
  if (oldgain == newgain) 
300
  if (oldgain == newgain) 
301
    return 0;
301
    return 0;
302
 
302