php 无限分类的树类代码

<?php
/**
by lenush;
*/
class tree
{
var $data = array();
var $child = array(-1=>array());
var $layer = array(-1=>-1);
var $parent = array();

function tree ($value)
{
$this->setnode(0, -1, $value);
} // end func

function setnode ($id, $parent, $value)
{
$parent = $parent?$parent:0;

$this->data[$id] = $value;
$this->child[$id] = array();
$this->child[$parent][] = $id;
$this->parent[$id] = $parent;

if (!isset($this->layer[$parent]))
{
$this->layer[$id] = 0;
}
else
{
$this->layer[$id] = $this->layer[$parent] + 1;
}
} // end func

function getlist (&$tree, $root= 0)
{
foreach ($this->child[$root] as $key=>$id)
{
$tree[] = $id;

if ($this->child[$id]) $this->getlist($tree, $id);
}
} // end func


function getvalue ($id)
{
return $this->data[$id];
} // end func


function getlayer ($id, $space = false)
{
return $space?str_repeat($space, $this->layer[$id]):$this->layer[$id];
} // end func

function getparent ($id)
{
return $this->parent[$id];
} // end func

function getparents ($id)
{
while ($this->parent[$id] != -1)
{
$id = $parent[$this->layer[$id]] = $this->parent[$id];
}

ksort($parent);
reset($parent);

return $parent;
} // end func

function getchild ($id)
{
return $this->child[$id];
} // end func

function getchilds ($id = 0)
{
$child = array($id);
$this->getlist($child, $id);

return $child;
} // end func
} // end class


//new tree(根目录的名字);
//根目录的id自动分配为0
$tree = new tree('目录导航');

//setnode(目录id,上级id，目录名字);
$tree->setnode(1, 0, '目录1');
$tree->setnode(2, 1, '目录2');
$tree->setnode(3, 0, '目录3');
$tree->setnode(4, 3, '目录3.1');
$tree->setnode(5, 3, '目录3.2');
$tree->setnode(6, 3, '目录3.3');
$tree->setnode(7, 2, '目录2.1');
$tree->setnode(8, 2, '目录2.2');
$tree->setnode(9, 2, '目录2.3');
$tree->setnode(10, 6, '目录3.3.1');
$tree->setnode(11, 6, '目录3.3.2');
$tree->setnode(12, 6, '目录3.3.3');

//getchilds(指定目录id);
//取得指定目录下级目录.如果没有指定目录就由根目录开始
$category = $tree->getchilds();

//遍历输出
foreach ($category as $key=>$id)
{
echo $tree->getlayer($id, '|-').$tree->getvalue($id)."<br />\n";
}
?>