// search.h	V1.00	27.2.2000

#define MIN_AREA_SIZE 10
#define MAX_CLASSES 1000


typedef struct N
{
   int value;
   struct N *index_link;
   struct N *node_link;
} NODE;


// ----- Utility functions -----
NODE *add_node(NODE *list, int index, int arg_value);
void free_list(NODE *list, int index);
int equal_classes(NODE *list, int index_class, int class);
NODE *mark_as_equal(NODE *list, int index_class, int class);
int return_class(int *area_classes, int row, int col, int cols, int neighbor);
void process_equal_classes(NODE *equal_data, NODE *this_class,
			   int class_dimensions[MAX_CLASSES][5], int parent_class);


// ----- Search functions -----
int *simpleNeighborSearch(bitPicture *picture);