Introduction to the implementation method of generating classification tree by PHP Infinitus classification-PHP Tutorial-php.cn

Introduction to the implementation method of generating classification tree by PHP Infinitus classification

黄舟

Release： 2023-03-16 09:26:01

Original

2232 people have browsed it

This article mainly introduces the method of PHP to implement Infinitus classification to generate a classification tree. It briefly analyzes the principles and implementation methods of Infinitus classification in the form of examples, and involves PHP array traversal and judgment related operation skills. Friends who need it can refer to it. Next

The example in this article describes the method of generating a classification tree for Infinitus classification using PHP. I share it with you for your reference. The details are as follows:

The current classification database design is basically: each classification has an id primary key field, and a pid points to the id of the parent class, so that unlimited levels of classification can be achieved. The retrieved data is in the following format:

$arr = array(
  array("id" => 1 , "pid" => 0 , &#39;cat&#39; => &#39;栏目一&#39;),
  array("id" => 2 , "pid" => 0 , &#39;cat&#39; => &#39;栏目二&#39;),
  array("id" => 3 , "pid" => 1 , &#39;cat&#39; => &#39;栏目三&#39;),
  array("id" => 4 , "pid" => 2 , &#39;cat&#39; => &#39;栏目四&#39;),
  array("id" => 5 , "pid" => 1 , &#39;cat&#39; => &#39;栏目五&#39;),
  array("id" => 6 , "pid" => 5 , &#39;cat&#39; => &#39;栏目六&#39;),
  array("id" => 7 , "pid" => 5 , &#39;cat&#39; => &#39;栏目七&#39;),
  array("id" => 8 , "pid" => 6 , &#39;cat&#39; => &#39;栏目八&#39;),
  array("id" => 9 , "pid" => 1 , &#39;cat&#39; => &#39;栏目九&#39;),
  array("id" => 10 , "pid" => 0 , &#39;cat&#39; => &#39;栏目十&#39;),
  array("id" => 11 , "pid" => 10 , &#39;cat&#39; => &#39;栏目十一&#39;),
  array("id" => 12 , "pid" => 11 , &#39;cat&#39; => &#39;栏目十二&#39;),
  array("id" => 13 , "pid" => 2 , &#39;cat&#39; => &#39;栏目十三&#39;),
  array("id" => 14, "pid" => 13 , &#39;cat&#39; => &#39;栏目十四&#39;)
);

Copy after login

Without further ado, let’s go directly to the processing code:

//生成无限极分类树
function make_tree($arr){
  $refer = array();
  $tree = array();
  foreach($arr as $k => $v){
    $refer[$v[&#39;id&#39;]] = & $arr[$k]; //创建主键的数组引用
  }
  foreach($arr as $k => $v){
    $pid = $v[&#39;pid&#39;];  //获取当前分类的父级id
    if($pid == 0){
      $tree[] = & $arr[$k];  //顶级栏目
    }else{
      if(isset($refer[$pid])){
        $refer[$pid][&#39;subcat&#39;][] = & $arr[$k]; //如果存在父级栏目，则添加进父级栏目的子栏目数组中
      }
    }
  }
  return $tree;
}

Copy after login

Test run:

$cat = make_tree($arr);
print_r($cat);

Copy after login

Running result:

Copy after login

The above is the detailed content of Introduction to the implementation method of generating classification tree by PHP Infinitus classification. For more information, please follow other related articles on the PHP Chinese website!