多级树的遍历

  1. class MultilevelTree
  2. {
  3.     private $depth;//深度
  4.     private $i; //深度计数器
  5.     private static $db ; //数据库对象
  6.     public $arr; //节点数据数组
  7.     public $deep; //最大深度
  9.     function __construct($depth=0)
  10.     {
  11.         $this->depth = $depth;
  12.         $this->i = 0;
  13.         $this->arr = array();
  14.         $this->deep = 0;
  15.     }
  17.     static function instanceDb(){
  18.         if(!MultilevelTree::instanceDb()){
  19.             return new DB();
  20.         }else{
  21.             return MultilevelTree::instanceDb();
  22.         }
  23.     }
  25.     /**
  26.      * 左序遍历
  27.      * @param $uid 当前节点的id
  28.      */
  29.     function traversal_left($uid){
  30.         $data = MultilevelTree::instanceDb()->query('select * from by_distribution where pid = '.$uid);
  31.         foreach ($data as $v){
  32.             if($v['uid']){
  33.                 $this->arr[] = $v;
  34.                 $this->traversal_left($v['uid']);
  35.             }
  36.         }
  37.     }
  39.     /**
  40.      * 根据层数遍历，并返回不包括本身的所有下层的数组
  41.      * @param $uid 当前节点的id
  42.      */
  43.     function getChildren($uid){
  44.         $this->i++;
  45.         $data = MultilevelTree::instanceDb()->query('select * from by_distribution where pid = '.$uid);
  46.         $this->arr = array_merge($this->arr,$data);
  47.         if($this->depth > 0){
  48.             if($this->i == $this->depth){
  49.                 $this->i=1; //每当纵向一条树线等于深度时，将深度计数器重置为1
  50.                 return;
  51.             }
  52.         }
  54.         foreach ($data as $v){
  55.             if($v['uid']){
  56.                 $this->getChildren($v['uid']);
  57.             }
  58.         }
  59.     }
  60.     /**
  61.      * 获取整棵树最大深度
  62.      * @param $uid 当前节点的id
  63.      */
  64.     function getChildrenDepth($uid){
  65.         $this->i++;
  66.         $data = MultilevelTree::instanceDb()->query('select * from by_distribution where pid = '.$uid);
  68.         foreach ($data as $v){
  69.             if($v['uid']){
  70.                 $data2 = MultilevelTree::instanceDb()->query('select * from by_distribution where pid = '.$v['uid']);
  71.                 if(!$data2){
  72.                     if($this->deep < $this->i) $this->deep = $this->i;
  73.                     $this->i=1; //每当没有子节点时，将计数器重置为初始值+1
  74.                     return;
  75.                 }
  76.                 $this->getChildrenDepth($v['uid']);
  77.             }
  78.         }
  79.     }
  81.     /**
  82.      * 获取父级数据
  83.      * @param $pid 当前节点的父级id
  84.      */
  85.     function getParent($pid){
  86.         $parent = MultilevelTree::instanceDb()->row('select * from by_distribution where uid = '.$pid);
  87.         if($this->i == $this->depth){
  88.             return;
  89.         }
  90.         if($parent['pid'] == 0) array_push($this->arr,$parent);//根节点
  92.         if($parent['pid']){
  93.             array_push($this->arr,$parent);
  94.             $this->i++;
  95.             $this->getParent($parent['pid']);
  96.         }
  97.     }
  98. }

单元测试

  1. class TestMultilevelTree extends PHPUnit_Framework_TestCase
  2. {
  3.     /**
  4.      * 获取子节点数量
  5.      */
  6.     function testGetChildren(){
  7.         $mlt = new MultilevelTree();
  8.         $mlt->getChildren(1);
  9.         $this->assertEquals(11,count($mlt->arr));
  10.     }
  12.     /**
  13.      * 获取子节点最大深度
  14.      */
  15.     function testGetChildrenDepth(){
  16.         $mlt = new MultilevelTree();
  17.         $mlt->getChildrenDepth(1);
  18.         $this->assertEquals(4,$mlt->deep);
  19.     }
  21.     /**
  22.      * 获取获取父节点
  23.      */
  24.     function testGetParent(){
  25.         $mlt = new MultilevelTree(10);
  26.         $mlt->getParent(2);
  27.         $this->assertEquals(2,count($mlt->arr));
  28.     }
  29. }