php递归算法经典实例,php递归算法应用实例

例子,php递归算法实例。

复制代码 代码示例:

function Type($tid) {

$rs = $this->conn->Execute("SELECT * FROM protype where id=$tid");

if ($rs) {

$i = 0;

$type[] = array();

while (!$rs->EOF) {

$type[$i] = $rs->fields;

$type[$i]['child'] = $this->GetClass($type[$i]['id']);

$i++;

$rs->MoveNext();

}

}

return $type;

}

function GetClass($tid) {

$rs = $this->conn->Execute("SELECT * FROM proclass where tid=$tid");

if ($rs) {

$i = 0;

$class[] = array();

while (!$rs->EOF) {

$class[$i] = $rs->fields;

$class[$i]['child'] = $this->GetPro($class[$i]['id']);

$i++;

$rs->MoveNext();

}

}

return $class;

}

function GetGroup($cid) {

$rs = $this->conn->Execute("SELECT * FROM progroup where cid=$cid");

if ($rs) {

$i = 0;

$group[] = array();

while (!$rs->EOF) {

$group[$i] = $rs->fields;

$group[$i]['child'] = $this->GetPro($group[$i]['id']);

$i++;

$rs->MoveNext();

}

}

return $group;

}

function GetPro($cid) {

$rs = $this->conn->Execute("SELECT * FROM prolist where cid=$cid limit 5");

if ($rs) {

$i = 0;

while (!$rs->EOF) {

$plist[$i] = $rs->fields;

$i++;

$rs->MoveNext();

}

}

return $plist;

}

function PageHead() {

$this->GetAdvit();

$rs = $this->conn->Execute("SELECT * FROM protype");

if ($rs) {

$i = 0;

$type[] = array();

while (!$rs->EOF) {

$type[$i] = $rs->fields;

$type[$i]['child'] = $this->GetClass($type[$i]['id']);

$i++;

$rs->MoveNext();

}

}

$this->smarty->assign("alltype", $type);

$rs = $this->conn->Execute("SELECT * FROM province");

if ($rs) { //递归算法 www.jbxue.com

$i = 0;

while (!$rs->EOF) {

$pvc[$i] = $rs->fields;

$i++;

$rs->MoveNext();

}

}

$this->smarty->assign("pvc", $pvc);

$this->smarty->display("head.html");

}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值