开通博客赚积分
发布资源赚积分
分类

源码开发语言/平台
当前位置：首页 > 源码/资料 > 数值算法/人工智能 > 查看源码
pset.c
资源名称：leda.tar.gz　[点击查看]
上传用户：gzelex
上传日期：2007-01-07
资源大小：707k
文件大小：3k
源码类别：

数值算法/人工智能

开发平台：

MultiPlatform

pset.c：源码内容
  1. #include <LEDA/point_set.h>
  6. main()
  7. {
  9.   point_set<string> S;
  11.   list<ps_item> L;
  12.   ps_item       it=nil;
  13.   point         p; 
  14.   char          ch;
  18.   while (ch != 'q')
  19.   { 
  20.     cout << "(r/s/f/n/i/d/D/l/q): ";
  21.     cin  >> ch;
  23.     float T  = used_time();
  24.      
  25.     switch(ch) {
  27.     case 'i':  { cout << "insert point: ";
  28.                  cin >> p;
  29.                  S.insert(p,string("x = %f",p.xcoord()));
  30.                  break;
  31.                 }
  33.      case 'n': { cout << "nearest neighbor: ";
  34.          cin >> p;
  35.                  it = S.nearest_neighbor(p);
  36.                  if (it!=nil) cout << S.key(it);
  37.                  else cout << "Empty point set.n";
  38.                  newline;
  39.                  break;
  40.                }
  43.     case 'r' : { int n = read_int("#random points = ");
  44.                  while (n--)
  45.                  { double x = rand_int(1,1000)/100.0;
  46.                    double y = rand_int(1,1000)/100.0;
  47.                    S.insert(point(x,y),string("x = %f",x));
  48.                   }
  49.                  cout << string("time: %6.2fn",used_time(T));
  50.                  break;
  51.                 }
  53.     case 's': { double a=read_real("x0=");
  54.                 double b=read_real("x1=");
  55.                 double c=read_real("y0=");
  56.                 double d=read_real("y1=");
  57.   
  58.                 L = S.range_search(a,b,c,d);
  59.   
  60.                 forall(it,L) cout << S.key(it) << " " << S.inf(it) << "n";
  61.                 newline;
  62.               
  63.                 cout << string("time: %6.2fn",used_time(T));
  64.                 break;
  65.               }
  68.     case 'd': { cout << "delete point: ";
  69.         cin >> p;
  70.                 S.del(p);
  71.                 break;
  72.                }
  74.     case 'D': { double a=read_real("x0=");
  75.                 double b=read_real("x1=");
  76.                 double c=read_real("y0=");
  77.                 double d=read_real("y1=");
  78.   
  79.                 L = S.range_search(a,b,c,d);
  80.   
  81.                 forall(it,L) 
  82.                 { point p = S.key(it);
  83.                   cout << "delete: " << p <<"n";
  84.                   S.del(p);
  85.                  }
  86.                 newline;
  87.               
  88.                 cout << string("time: %6.2fn",used_time(T));
  89.                 break;
  90.               }
  93.     case 'f': { cout << "find point: ";
  94.         cin >> p;
  95.                 if (S.lookup(p) != nil) cout << "yes";
  96.                 else cout << "no";
  97.                 newline;
  98.                 break;
  99.                }
  102.     case 'l': { L = S.all_items();
  103.                 forall(it,L) 
  104.                   cout << S.key(it) << " " << S.inf(it) << "n";
  105.                 newline;
  106.                 break;
  107.                }
  110.     } //switch
  112.   } //for
  114.   return 0;
  115. }