/misc/src/release/graphviz-2.18-1/src/graphviz-2.18/lib/neatogen/closest.c File Reference

#include "kkutils.h"
#include "closest.h"
#include <stdlib.h>

Include dependency graph for closest.c:

Go to the source code of this file.

Data Structures

struct  Pair
struct  PairStack
struct  PairHeap

Defines

#define LT(p, q)   ((p).dist < (q).dist)
#define EQ(p, q)   ((p).dist == (q).dist)
#define push(s, x)
#define pop(s, x)   ((s->top==0) ? FALSE : (s->top--, x = s->data[s->top], TRUE))
#define read_top(h, x)   ((s->top==0) ? FALSE : (x = s->data[s->top-1], TRUE))
#define sub(h, i)   (h->data[i])
#define left(i)   (2*(i))
#define right(i)   (2*(i)+1)
#define parent(i)   ((i)/2)
#define insideHeap(h, i)   ((i)<h->heapSize)
#define greaterPriority(h, i, j)   (LT(h->data[i],h->data[j]) || ((EQ(h->data[i],h->data[j])) && (rand()%2)))
#define exchange(h, i, j)
#define assign(h, i, j)   {h->data[i]=h->data[j]}

Functions

void closest_pairs2graph (double *place, int n, int num_pairs, vtx_data **graph)


Define Documentation

#define assign ( h,
i,
 )     {h->data[i]=h->data[j]}

Definition at line 101 of file closest.c.

#define EQ ( p,
 )     ((p).dist == (q).dist)

Definition at line 37 of file closest.c.

#define exchange ( h,
i,
 ) 

Value:

{Pair temp; \
        temp=h->data[i]; \
        h->data[i]=h->data[j]; \
        h->data[j]=temp; \
}

Definition at line 96 of file closest.c.

Referenced by build_ranks().

#define greaterPriority ( h,
i,
 )     (LT(h->data[i],h->data[j]) || ((EQ(h->data[i],h->data[j])) && (rand()%2)))

Definition at line 93 of file closest.c.

#define insideHeap ( h,
 )     ((i)<h->heapSize)

Definition at line 92 of file closest.c.

#define left (  )     (2*(i))

Definition at line 89 of file closest.c.

#define LT ( p,
 )     ((p).dist < (q).dist)

Definition at line 36 of file closest.c.

Referenced by Proutespline().

#define parent (  )     ((i)/2)

Definition at line 91 of file closest.c.

Referenced by createBlocktree(), and push_obj_state().

#define pop ( s,
 )     ((s->top==0) ? FALSE : (s->top--, x = s->data[s->top], TRUE))

Definition at line 74 of file closest.c.

#define push ( s,
 ) 

Value:

{ \
        if (s->top>=s->max_size) { \
                s->max_size *= 2; \
                s->data = (Pair*) realloc(s->data, s->max_size*sizeof(Pair)); \
        } \
        s->data[s->top++] = x; \
}

Definition at line 66 of file closest.c.

#define read_top ( h,
 )     ((s->top==0) ? FALSE : (x = s->data[s->top-1], TRUE))

Definition at line 76 of file closest.c.

#define right (  )     (2*(i)+1)

Definition at line 90 of file closest.c.

Referenced by bezier_clip(), dot_concentrate(), and heapdown().

#define sub ( h,
 )     (h->data[i])

Definition at line 78 of file closest.c.

Referenced by xml_string().


Function Documentation

void closest_pairs2graph ( double *  place,
int  n,
int  num_pairs,
vtx_data **  graph 
)

Definition at line 357 of file closest.c.

References freeStack(), and graph().

Referenced by iterativePCA_1D().


Generated on Mon Mar 31 19:06:35 2008 for Graphviz by  doxygen 1.5.1