[php+mysql无限级分类(非递归) 要实现无限级分类,递归一般是第一个也是最容易想到的,但是递归一般被认为占用资源的方法,所以很多系统是不考虑使用递归的本文还是通过数据库
$db = mysql_connect('localhost', 'root', 'root') or die('Can\'t connect to database');
mysql_select_db('test') or die('Can\'t find database : test');
$result = mysql_query('select id, fid, name from tree');
while($arr = mysql_fetch_array($result)){
$data[] = array(
'id' => $arr['id'],
'fid' => $arr['fid'],
'name' => $arr['name'],
);
}
// 将数据按照缩进简单排列 见图1
function data2arr($tree, $rootId = 0, $level = 0) {
foreach($tree as $leaf) {
if($leaf['fid'] == $rootId) {
echo str_repeat(' ', $level) . $leaf['id'] . ' ' . $leaf['name'] . '
';
foreach($tree as $l) {
if($l['fid'] == $leaf['id']) {
data2arr($tree, $leaf['id'], $level + 1);
break;
}
}
}
}
}
data2arr($data);
echo '
-----------------------------------------------------------------------
';
// 将数据按照所属关系封装 见图2
function arr2tree($tree, $rootId = 0) {
$return = array();
foreach($tree as $leaf) {
if($leaf['fid'] == $rootId) {
foreach($tree as $subleaf) {
if($subleaf['fid'] == $leaf['id']) {
$leaf['children'] = arr2tree($tree, $leaf['id']);
break;
}
}
$return[] = $leaf;
}
}
return $return;
}
$tree = arr2tree($data);
print_r($tree);
echo '
-----------------------------------------------------------------------
';
// 将数据使用HTML再次展现 见图3
function tree2html($tree) {
echo '
- ';
foreach($tree as $leaf) {
echo '
' .$leaf['name'];if(! empty($leaf['children'])) tree2html($leaf['children']);
echo '
';}
echo '
';}
tree2html($tree);
[header(Content-type:text/html; charset=utf-8);/** * * @category contry_category 实现一个无限级别分类,类似种类的划分,常用在栏目导航 * *//** +---------------
图 1:
图 2:
图 3:
[让大家失望了,目前的答案似乎是:不能实现! 话说 mysql 都快到 6 了,早就号称支持存储过程了,可实际上呢!竟然不支持function中使用动态SQL 、更加不能返回数组