queue.h

一个可执行的nbc算法设计与实现 有助大家互相探讨学习

#ifndef QUEUE_H
#define QUEUE_H


#include "fstream.h"
#include "iostream.h"
#include "stdlib.h"
#include "math.h"

struct point{
	double x;
	double y;
	int num;
	struct point *next;
};


struct xpoint{
	double x;
	struct xpoint *next;
};


struct line{
	point *p1;
	point *p2;
	
	int tra_id;
	int clusterId;
	int line_mark;
	
	int kNB;
	int R_kNB;
//	double NDF;
	
	struct line *next;
	struct line *neigh_next;
};


struct cluster_line{
	point *p1;
	point *p2;
	int tra_id;
	struct cluster_line *next;
};

struct cluster{
	int cluster_id;
	cluster_line *first;
	int tra_num;
	struct cluster *next;
};


struct Dpoint{
	double dist;
	struct line *lp;
	struct Dpoint *next;
};

struct TRA{	
	point *first_point;
	struct TRA *next;
};


struct QNode{
   struct line *po;
   struct QNode *next;
};


class queue
{
 private:
     QNode *front;
	 QNode *rear;
 public:
	 queue()
	 {
		 front=rear=NULL;
	 }
	 void Insert_Queue(line *L);
	 void Del_Queue();
	 QNode *GetHead();
	 int Que_Empty();
	 void  Que_Reset();
};


#endif