#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 exchange | ( | h, | |||
i, | |||||
j | ) |
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 LT | ( | p, | |||
q | ) | ((p).dist < (q).dist) |
#define parent | ( | i | ) | ((i)/2) |
#define pop | ( | s, | |||
x | ) | ((s->top==0) ? FALSE : (s->top--, x = s->data[s->top], TRUE)) |
#define push | ( | s, | |||
x | ) |
#define read_top | ( | h, | |||
x | ) | ((s->top==0) ? FALSE : (x = s->data[s->top-1], TRUE)) |
#define right | ( | i | ) | (2*(i)+1) |
Definition at line 90 of file closest.c.
Referenced by bezier_clip(), dot_concentrate(), and heapdown().
#define sub | ( | h, | |||
i | ) | (h->data[i]) |
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().