Category

Development Platform
Home > SourceCode/Document > Mathimatics-Numerical algorithms > View Code
bin_tree.c
Package: leda.tar.gz　[view]
Upload User: gzelex
Upload Date: 2007-01-07
Package Size: 707k
Code Size: 2k
Category:

Mathimatics-Numerical algorithms

Development Platform:

MultiPlatform

bin_tree.c：Code Content
  2. #include <LEDA/impl/bin_tree.h>
  3. #include <LEDA/impl/avl_tree.h>
  4. #include <LEDA/impl/bb_tree.h>
  5. #include <LEDA/impl/rb_tree.h>
  6. #include <LEDA/impl/rs_tree.h>
  8. #include <LEDA/window.h>
  11. window W;
  13. void draw_node(double x, double y, void*, int bal)
  14. { W.draw_filled_node(x,y,yellow);
  15.   W.draw_ctext(x,y,string("%d",bal),violet); 
  16.  }
  18. void draw_leaf(double x, double y, void* key, int)
  19. { W.draw_filled_rectangle(x-1.4,y-1.4,x+1.4,y+1.4,black);
  20.   W.draw_ctext(x,y,string("%d",key),white); 
  21.  }
  24. void draw_edge(double x0, double y0, double x1, double y1)
  25. { W.draw_edge(point(x0,y0),point(x1,y1),blue); }
  28. main()
  29. {
  30.   bin_tree* TREE[5];
  31.   string    NAME[5];
  33.   TREE[0] = new bin_tree;  NAME[0] = "BINARY TREE";
  34.   TREE[1] = new avl_tree;  NAME[1] = "AVL TREE";
  35.   TREE[2] = new bb_tree;  NAME[2] = "BB[ALPHA] TREE";
  36.   TREE[3] = new rb_tree;   NAME[3] = "RED/BLACK TREE";
  37.   TREE[4] = new rs_tree;   NAME[4] = "RANDOMIZED SEARCH TREE";
  40.   panel P("BINARY TREES");
  42.   int n = 20;
  43.   int mode = 0;
  44.   int sel = 0;
  46.   P.choice_item("TREE",sel,"bin_tree","avl_tree","bb_tree","rb_tree","rs_tree");
  47.   P.choice_item("INPUT",mode,"random", "1 2 3 ...");
  49.   P.int_item("# INSERTS",n,0,50);
  51.   W.set_node_width(10);
  52.   W.set_line_width(2);
  54.   for(;;)
  55.   {
  56.     P.open();
  58.     W.clear();
  59.     W.message(NAME[sel]);
  61.     bin_tree* T = TREE[sel];
  62.   
  63.     T->clear();
  64.   
  65.     int i;
  66.   
  67.     if (mode==0)
  68.       for(i=0;i<n;i++) T->insert((void*)rand_int(0,99),0);
  69.     else
  70.       for(i=0;i<n;i++) T->insert((void*)i,0);
  71.   
  72.     double dy = (W.ymax()-W.ymin())/10;
  73.   
  74.     T->draw(draw_node,draw_leaf,draw_edge, W.xmin(),W.xmax(),W.ymax()-dy,dy);
  75.   
  76.     W.read_mouse();
  77.   
  78.   }
  79.   
  80.   return 0;
  81. }