分享一个php实现无限级分类程序代码

SELECT c.cat_id, c.cat_name, c.measure_unit, c.parent_id, c.is_show, c.show_in_nav, c.grade ,c.sort_order, COUNT( s.cat_id ) AS has_children
FROM ecs_category AS c
LEFT JOIN ecs_category AS s ON s.parent_id = c.cat_id
GROUP BY c.cat_id
ORDER BY c.parent_id, c.sort_order ASC

else
{
foreach($cateInfo as $key=>$val)
{
if($val[‘level’]>0)
{
$cateInfo[$key][‘catename’] = “|”.str_repeat(‘ ‘, $val[‘level’] * 8).”└─”.$val[‘catename’];

}
}
return $cateInfo;
}

}

/**
* 通过父ID递归得到所有子节点树
* @param int $catid 上级分类
* @param array $arr 含有所有分类的数组
* @return array
*/
public function getChildTree($catid,$arr)
{
$level = $last_cat_id = 0;
while (!empty($arr))
{
foreach($arr as $key=>$value)
{
$cid = $value[‘cid’];
if ($level == 0 && $last_cat_id == 0)
{
if ($value[‘parentid’] > 0)
{
break;
}
$options[$cid] = $value;
$options[$cid][‘level’] = $level;
$options[$cid][‘id’] = $cid;
$options[$cid][‘name’] = $value[‘catename’];
unset($arr[$key]);
if ($value[‘has_children’] == 0)
{
continue;
}
$last_cat_id = $cid;
$cat_id_array = array($cid);
$level_array[$last_cat_id] = ++$level;
continue;

}
if ($value[‘parentid’] == $last_cat_id)
{
$options[$cid] = $value;
$options[$cid][‘level’] = $level;
$options[$cid][‘id’] = $cid;
$options[$cid][‘name’] = $value[‘catename’];
unset($arr[$key]);
if ($value[‘has_children’] > 0)
{
if (end($cat_id_array) != $last_cat_id)
{
$cat_id_array[] = $last_cat_id;
}
$last_cat_id = $cid;
$cat_id_array[] = $cid;
$level_array[$last_cat_id] = ++$level;
}
}
elseif ($value[‘parentid’] > $last_cat_id)
{
break;
}
}

$count = count($cat_id_array);
if ($count > 1)
{
$last_cat_id = array_pop($cat_id_array);

}
elseif ($count == 1)
{
if ($last_cat_id != end($cat_id_array))
{
$last_cat_id = end($cat_id_array);
}
else
{
$level = 0;
$last_cat_id = 0;
$cat_id_array = array();
continue;
}
}
if ($last_cat_id && isset($level_array[$last_cat_id]))
{
$level = $level_array[$last_cat_id];
}
else
{
$level = 0;
}
}
return $options;