无限极分类

public function sel_all(){
    $arr = (new \yii\db\Query())
        ->select(['id', 'enterprise_name','fid','leve'])
        ->from('enterprise')
        ->all();
    $tree = array();
    //第一步，将分类id作为数组key,并创建children单元
    foreach($arr as $category){
        $tree[$category['id']] = $category;
        $tree[$category['id']]['children'] = array();
    }
    //第二部，利用引用，将每个分类添加到父类children数组中，这样一次遍历即可形成树形结构。
    foreach ($tree as $k=>$item) {
        if ($item['fid'] != 0) {
            $tree[$item['fid']]['children'][] = &$tree[$k];
        }
    }
    return $tree;
    //调用list_level方法
    //return self::list_level($arr,$pid=0,$level=0);
}