ls_clustering.h

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

#ifndef  LS_CLUSTERING_H
#define  LS_CLUSTERING_H

#include "queue.h"

class LS_CLUSTERING{
private:
	line* first;
	line* last;

	cluster *first_cluster;
	cluster *last_cluster;

	int k;
	Dpoint *Dp_first;

	queue Q;
public:
	LS_CLUSTERING(int t,line *ft,line *la)
	{
		first=ft;
		last=la;
		first_cluster=NULL;
		last_cluster=NULL;
		Dp_first=NULL;
        k=t;
		Q.Que_Reset();		
	}
	
	line *get_linelist();
	line *get_last();
	cluster *get_first_cluster();
	
	double dist(line *lp,line *tp);
	double distance(line *lp,line *tp);
	double l_distance(line *lp);
    
	int  Dp_insert(double dt,line *ls);
	void CalcNDFs();
	void CalcNDF(line *ls);
	void ouputNDF();

	void ComputeKNB(line *ls);
	void ExpandCluster(int clusterId);	
	void ls_clustering();


	void new_cluster(int clusterId);
	int  insert_line(line *ls);
	void check_tra_num(int k);
    void output_cluster();
	
    
};


#endif