空间数据结构程序(石家庄经院2012.06.18).docVIP

边长为1的正方形内最接近点的个数计算: #include iostream.h #include stdio.h struct point { float x; float y; }; float distance(point a,point b); #include point.h #include math.h float distance (point a,point b) { return sqrt((b.x-a.x)*(b.x-a.x)+(b.y-a.y)*(b.y-a.y)); } #include math.h #include iostream.h #include stdlib.h #include point.h float randfloat () { return 1.0*rand()/RAND_MAX; } int main(int argc,char*argv[]) { int i,j,cnt=0,N=atof(argv[1]); float d=atof(argv[2]); point*a=new point [N]; for(i=0;iN;i++) { a[i].x=randfloat();a[i].y=randfloat(); } for(i=0;iN;i++) { for(j=i+1;jN;j++) { if(distance(a[i],a[j])d) cnt++; } } coutcntpairs withindendl; return 0; } 边长为1的正方形内最接近点的个数计算（ADT）: #include iostream.h #include stdlib.h class point { private: float x; float y; public: point(); float X() const; float Y() const; friend float distance(point ,point ); }; #include point.h #include iostream.h #include stdlib.h #include math.h float distance (point a,point b) { float m=b.x-a.x,n=b.y-a.y; return sqrt(m*m+n*n); } float point::X() const { return x; } float point::Y() const { return y; } point::point() { x=1.0*rand()/RAND_MAX; y=1.0*rand()/RAND_MAX; } #include math.h #include iostream.h #include stdlib.h #include point.h int main(int argc,char*argv[]) { int i,j,cnt=0,N=atof(argv[1]); float d=atof(argv[2]); point*a=new point [N]; for(i=0;iN;i++) { for(j=i+1;jN;j++) { if(distance(a[i],a[j])d) cnt++; } } coutcntpairs withindendl; return 0; } 队列（链表）: templateclass Item class quene { struct node{ Item item;node*next; node(Item t) { item=t;next=0; } }; typedef node* link; link head,tail; public: quene(int n); int empty(); void put(Item); Item get(); }; #include iostr