/**
* short description.
*
* detail description
* @author
* @version 1.0
* @copyright
* @access public
*/
class tree
{
/**
* description
* @var
* @since 1.0
* @access private
*/
var $data = array();
/**
* description
* @var
* @since 1.0
* @access private
*/
var $child = array(-1=>array());
/**
* description
* @var
* @since 1.0
* @access private
*/
var $layer = array(-1=>-1);
/**
* description
* @var
* @since 1.0
* @access private
*/
var $parent = array();
/**
* short description.
*
* detail description
* @param none
* @global none
* @since 1.0
* @access private
* @return void
* @update date time
*/
function tree ($value)
{
$this->setnode(0, -1, $value);
} // end func
/**
* short description.
*
* detail description
* @param none
* @global none
* @since 1.0
* @access private
* @return void
* @update date time
*/
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
/**
* short description.
*
* detail description
* @param none
* @global none
* @since 1.0
* @access private
* @return void
* @update date time
*/
function getlist (&$tree, $root= 0)
{
foreach ($this->child[$root] as $key=>$id)
{
$tree[] = $id;
if ($this->child[$id]) $this->getlist($tree, $id);
}
} // end func
/**
* short description.
*
* detail description
* @param none
* @global none
* @since 1.0
* @access private
* @return void
* @update date time
*/
function getvalue ($id)
{
return $this->data[$id];
} // end func
/**
* short description.
*
* detail description
* @param none
* @global none
* @since 1.0
* @access private
* @return void
* @update date time
*/
function getlayer ($id, $space = false)
{
return $space?str_repeat($space, $this->layer[$id]):$this->layer[$id];
} // end func
/**
* short description.
*
* detail description
* @param none
* @global none
* @since 1.0
* @access private
* @return void
* @update date time
*/
function getparent ($id)
{
return $this->parent[$id];
} // end func
/**
* short description.
*
* detail description
* @param none
* @global none
* @since 1.0
* @access private
* @return void
* @update date time
*/
function getparents ($id)
{
while ($this->parent[$id] != -1)
{
$id = $parent[$this->layer[$id]] = $this->parent[$id];
}
ksort($parent);
reset($parent);
return $parent;
} // end func
/**
* short description.
*
* detail description
* @param none
* @global none
* @since 1.0
* @access private
* @return void
* @update date time
*/
function getchild ($id)
{
return $this->child[$id];
} // end func
/**
* short description.
*
* detail description
* @param none
* @global none
* @since 1.0
* @access private
* @return void
* @update date time
*/
function getchilds ($id = 0)
{
$child = array($id);
$this->getlist($child, $id);
return $child;
} // end func
} // end class
?>
php代码:
//setnode(目录id,上级id,目录名字);
$tree->setnode(1, 0, '目录1');
$tree->setnode(2, 0, '目录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";
}
php无限分类-php100代码
如对本文有疑问, 点击进行留言回复!!
[ACTF2020 新生赛]Include 1【文件包含】【读取代码】
算法题解 - 牛客编程巅峰赛S1第6场 - 黄金&钻石&王者组
推荐一个程序员必备网站之一:Dev Hints ,非常实用!
网友评论