php根据分类生成网址,php无限极分类生成分类树的实现方法介绍

这篇文章主要介绍了PHP实现无限极分类生成分类树的方法,结合实例形式简单分析了无限极分类的原理与实现方法,涉及PHP数组遍历与判断相关操作技巧,需要的朋友可以参考下

本文实例讲述了PHP实现无限极分类生成分类树的方法。分享给大家供大家参考,具体如下:

现在的分类数据库设计基本都是:每一个分类有一个id主键字段,一个pid指向父类的id,这样便可实现无限级分类,取出的数据就是如下的格式:$arr = array(

array("id" => 1 , "pid" => 0 , 'cat' => '栏目一'),

array("id" => 2 , "pid" => 0 , 'cat' => '栏目二'),

array("id" => 3 , "pid" => 1 , 'cat' => '栏目三'),

array("id" => 4 , "pid" => 2 , 'cat' => '栏目四'),

array("id" => 5 , "pid" => 1 , 'cat' => '栏目五'),

array("id" => 6 , "pid" => 5 , 'cat' => '栏目六'),

array("id" => 7 , "pid" => 5 , 'cat' => '栏目七'),

array("id" => 8 , "pid" => 6 , 'cat' => '栏目八'),

array("id" => 9 , "pid" => 1 , 'cat' => '栏目九'),

array("id" => 10 , "pid" => 0 , 'cat' => '栏目十'),

array("id" => 11 , "pid" => 10 , 'cat' => '栏目十一'),

array("id" => 12 , "pid" => 11 , 'cat' => '栏目十二'),

array("id" => 13 , "pid" => 2 , 'cat' => '栏目十三'),

array("id" => 14, "pid" => 13 , 'cat' => '栏目十四')

);

不多说,直接上处理代码://生成无限极分类树

function make_tree($arr){

$refer = array();

$tree = array();

foreach($arr as $k => $v){

$refer[$v['id']] = & $arr[$k]; //创建主键的数组引用

}

foreach($arr as $k => $v){

$pid = $v['pid']; //获取当前分类的父级id

if($pid == 0){

$tree[] = & $arr[$k]; //顶级栏目

}else{

if(isset($refer[$pid])){

$refer[$pid]['subcat'][] = & $arr[$k]; //如果存在父级栏目,则添加进父级栏目的子栏目数组中

}

}

}

return $tree;

}

测试运行:$cat = make_tree($arr);

print_r($cat);

运行结果:Array

(

[0] => Array

(

[id] => 1

[pid] => 0

[cat] => 栏目一

[subcat] => Array

(

[0] => Array

(

[id] => 3

[pid] => 1

[cat] => 栏目三

)

[1] => Array

(

[id] => 5

[pid] => 1

[cat] => 栏目五

[subcat] => Array

(

[0] => Array

(

[id] => 6

[pid] => 5

[cat] => 栏目六

[subcat] => Array

(

[0] => Array

(

[id] => 8

[pid] => 6

[cat] => 栏目八

)

)

)

[1] => Array

(

[id] => 7

[pid] => 5

[cat] => 栏目七

)

)

)

[2] => Array

(

[id] => 9

[pid] => 1

[cat] => 栏目九

)

)

)

[1] => Array

(

[id] => 2

[pid] => 0

[cat] => 栏目二

[subcat] => Array

(

[0] => Array

(

[id] => 4

[pid] => 2

[cat] => 栏目四

)

[1] => Array

(

[id] => 13

[pid] => 2

[cat] => 栏目十三

[subcat] => Array

(

[0] => Array

(

[id] => 14

[pid] => 13

[cat] => 栏目十四

)

)

)

)

)

[2] => Array

(

[id] => 10

[pid] => 0

[cat] => 栏目十

[subcat] => Array

(

[0] => Array

(

[id] => 11

[pid] => 10

[cat] => 栏目十一

[subcat] => Array

(

[0] => Array

(

[id] => 12

[pid] => 11

[cat] => 栏目十二

)

)

)

)

)

)

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值