有什么好用的无限分类吗

3.1. 商品类目数据库结构设计

https://github.com/summerblue/laravel-shop...

@zhouzishu ?

@张无忌 多级无限分类的数据库结构

简单粗暴了点~

$arrs = [
    [
        'id'=>1,
        'parent_id'=>0
    ],
    [
        'id'=>2,
        'parent_id'=>1
    ],
    [
        'id'=>3,
        'parent_id'=>2
    ],
    [
        'id'=>4,
        'parent_id'=>2
    ],
    [
        'id'=>5,
        'parent_id'=>0
    ],
];
var_export(getTree($arrs));
function getTree($arrs,$root=0)
{
    $tree = array();
    foreach ($arrs as $foo) {
        if ($foo['parent_id'] == $root) {
            $foo['children'] = getTree($arrs,$foo['id']);
            $tree[] = $foo;
        }
    }
    return $tree;
}

输出

array (
  0 => 
  array (
    'id' => 1,
    'parent_id' => 0,
    'children' => 
    array (
      0 => 
      array (
        'id' => 2,
        'parent_id' => 1,
        'children' => 
        array (
          0 => 
          array (
            'id' => 3,
            'parent_id' => 2,
            'children' => 
            array (
            ),
          ),
          1 => 
          array (
            'id' => 4,
            'parent_id' => 2,
            'children' => 
            array (
            ),
          ),
        ),
      ),
    ),
  ),
  1 => 
  array (
    'id' => 5,
    'parent_id' => 0,
    'children' => 
    array (
    ),
  ),
)

@jcc123 如果只要一级和二级分类的树状结构呢

@张无忌 那就加个级别限制咯~

function getTree($arrs,$root=0,$level=100)
{
    $tree = array();
    foreach ($arrs as $foo) {
        if ($foo['parent_id'] == $root) {

           if($level>0){               
            $foo['children'] = getTree($arrs,$foo['id'],$level-1);     
           }
            $tree[] = $foo;

        }
    }
    --$level;
    return $tree;
}

var_export($arrs,0,0)//一级

array (
  0 => 
  array (
    'id' => 1,
    'parent_id' => 0,
  ),
  1 => 
  array (
    'id' => 5,
    'parent_id' => 0,
  ),
)

var_export($arrs,0,1)//两级

array (
  0 => 
  array (
    'id' => 1,
    'parent_id' => 0,
    'children' => 
    array (
      0 => 
      array (
        'id' => 2,
        'parent_id' => 1,
      ),
    ),
  ),
  1 => 
  array (
    'id' => 5,
    'parent_id' => 0,
    'children' => 
    array (
      0 => 
      array (
        'id' => 6,
        'parent_id' => 5,
      ),
    ),
  ),
)

/**
     * 把返回的数据集转换成Tree
     *
     * @param $list
     * @param string $pk
     * @param string $pid
     * @param string $child
     * @param int $root
     * @return array
     */
    public static function list_to_tree($list, $pk = 'id', $pid = 'pid', $child = '_child', $root = 0)
    {
        // 创建Tree
        $tree = [];
        if (is_array($list)) {
            // 创建基于主键的数组引用
            $refer = [];
            foreach ($list as $key => $data) {
                $refer[$data[$pk]] = &$list[$key];
            }
            foreach ($list as $key => $data) {
                // 判断是否存在parent
                $parentId = $data[$pid];
                if ($root == $parentId) {
                    $tree[] = &$list[$key];
                } else {
                    if (isset($refer[$parentId])) {
                        $parent = &$refer[$parentId];
                        $parent[$child][] = &$list[$key];
                    } else {
                        $tree[] = &$list[$key];
                    }
                }
            }
        }
        return $tree;
    }

试试这个 Laravel-nestedset

想到一篇自己的博客：https://wi1dcard.cn/posts/php-fastest-crea...

另，我也推荐：https://github.com/lazychaser/laravel-nest...

https://github.com/lazychaser/laravel-nest...

使用模型自带关联关系可以实现无限级

    /**
     * 返回子节点
     * @return \Illuminate\Database\Eloquent\Relations\HasMany
     */
    public function children()
    {
        return $this->hasMany(get_class($this),'p_id','id');
    }

    /**
     * 所有子节点
     * @return \Illuminate\Database\Eloquent\Relations\HasMany
     */
    public function allChildren()
    {
        return $this->children()->with( 'allChildren' );
    }

    /**
     * 父节点
     * @return \Illuminate\Database\Eloquent\Relations\HasOne
     */
    public function parent()
    {
        return $this->hasOne(get_class($this),'id','p_id');
    }