99分求一个无限分类算法的类

[renqiang_888]

因为项目当中要用到无限分类，以前用的是递归的方法，和用路径的方法（无法实现排序）来实现的，
现在感觉二者都不太好，现在想求一个效率高一点算法来实现，
请有的朋友贡献一下，谢谢了

[一把编程的菜刀]

<?php
/**
* @author        YangHuan,Fonqing
* @datetime   
* @version        1.0.0
* This class base at Yanghuan's PHP Tree
* Modify By Fonqing:
* Memo:
*      1,Add some method functions
*/
class SortClass{
    public $data   = array();
    public $child  = array(-1=>array());
    public $layer  = array(-1=>-1);
    public $parent = array();
    public $link;
    public $table;
    /**
     *  void SortClass($link, $table)
     *  The constructor of the class
     *  @param $link    resource    MySQL link identifier
     *  @param $table   string      The name of the category talbe
     *  @return void
     */
    function SortClass($link, $table){
        $this->setNode(0, -1, '顶极节点');
        $this->link = $link;
        $this->table = $table;
        $node = array();
        $results = mysql_query('select * from '.$this->table.'',$this->link);
        while($node = mysql_fetch_assoc($results)){
            $this->setNode($node['cid'],$node['pid'],$node['cname']);
        }
    }
    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;
        $this->layer[$id] = !isset($this->layer[$parent])? 0 : $this->layer[$parent] + 1;
    }
    function getList (&$tree, $root= 0){
        foreach ($this->child[$root] as $key=>$id){
            $tree[] = $id;
            if ($this->child[$id]) $this->getList($tree, $id);
        }
    }
    function getValue ($id){return $this->data[$id];}
    function getLayer ($id, $space = false){
        return $space?str_repeat($space, $this->layer[$id]):$this->layer[$id];
    }
    function getParent ($id){return $this->parent[$id];}
    function getParents ($id){
        while ($this->parent[$id] != -1){
            $id = $parent[$this->layer[$id]] = $this->parent[$id];
        }
        ksort($parent);
        reset($parent);
        return $parent;
    }
    function getChild ($id){return $this->child[$id];}
    function getChilds ($id = 0){
        $child = array($id);
        $this->getList($child, $id);
        return $child;
    }
    /**
     *  void addNode($name, $pid)
     *  Add a new Node to the tree and insert into the database
     *  @param $name    string  The node name
     *  @param $pid     integer The parent node of this new node
     *  @return void
     */
    function addNode($name, $pid){
        mysql_query("insert into $this->table (`pid`,`cname`) values ('$pid','$name')", $this->link);
    }
    /**
     *  void modNode($cid, $newName)
     *  Modify a node to a new name
     *  @param $cid     integer The `cid` of the node which to modify
     *  @param $newName string  The new name
     *  @return void
     */
    function modNode($cid, $newName){
        mysql_query("update $this->table set `cname`='$newName' where `cid` = $cid", $this->link);
    }
    /**
     *  void delNode($cid)
     *  Delete a node and all of its childs
     *  @param $cid     integer The node to delete
     *  @return void
     */
    function delNode($cid){
        $allChilds = $this->getChilds($cid);
        $sql ='';
        if(empty($allChilds)){
            $sql = "delete from $this->table where `cid` = $cid";
        }else{
            $sql = 'delete from '.$this->table.' where `cid` in ('.implode(',',$allChilds).','.$cid.')';
        }
        mysql_query($sql, $this->link);
    }
    /**
     *  void moveNode($cid, $topid)
     *  Add a new Node to the tree and insert into the database
     *  @param $cid     integer  The node id which to move
     *  @param $topid   integer  New parent id
     *  @return void
     */
    function moveNode($cid, $topid){
        $tos = $this->getChilds($cid);
        if(in_array($topid,$tos)) return;//不能移动到其子分类
        mysql_query("update $this->table set `pid`=$topid where `cid` = $cid", $this->link);
    }
    
    function __destruct(){
        unset($this->data,
              $this->child,
              $this->parent,
              $this->layer);
    }
}
?>

CREATE DATABASE `sortclass`DEFAULT CHARSET utf8;
CREATE TABLE IF NOT EXISTS `class` (
`cid` mediumint(8) unsigned NOT NULL auto_increment,
`pid` mediumint(8) unsigned NOT NULL,
`cname` varchar(50) NOT NULL,
PRIMARY KEY (`cid`),
KEY `pid` (`pid`)
) ENGINE=MyISAM DEFAULT CHARSET=utf8; 

下面是使用例子：

<?php
header("Content-type: text/html; charset=utf-8");
//Import the class
require('Class.sort.php');
//Connect to the MySQL server
$link = mysql_connect('host','user','pass') or die(mysql_error());
mysql_select_db('sortclass',$link);
$tree = new SortClass($link,'`class`');
//Some functions 
function back(){
    echo '<script language="javascript">window.location.href="test.php?"+new Date().getTime();</script>';
    exit;
}
//Create select html
function makeSelect($array,$formName){
    global $tree;
    $select = '<select name="'.$formName.'">';
    foreach ($array as $id){
        $select.='<option value="'.$id.'">'.$tree->getLayer($id, '|-').$tree->getValue($id)."</option>";
    }
    return $select.'</select>';
}
//Controller
$op = !empty($_POST['op']) ? $_POST['op'] : $_GET['op'];
if(!empty($op)){
    
    if($op=='add'){
        $tree->addNode($_POST['cname'],$_POST['pid']);
        back();
    }
    
    if($op=='mod'){
        $tree->modNode($_POST['cid'],$_POST['cname']);
        back();
    }
    
    if($op=='del'){
        $tree->delNode($_GET['cid']);
        back();
    }
    
    if($op=='move'){
        $tree->moveNode($_POST['who'],$_POST['to']);
        back();
    }
}
$category = $tree->getChilds();
?>
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html>
<head>
    <meta http-equiv="Content-type" content="text/html; charset=utf-8" />
    <title>无限分类示例</title>
<style type="text/css">
body{font-size:12px;}
ul{list-style:none;}
a{cursor:pointer;}
</style>
<script language="javascript">
function $(e){return document.getElementById(e);}
function mod(cid){
    $('cid').value=cid;
    $('op').value='mod';
    $('name').style.border='2px solid red';
    $('name').value  = '这里填写新名称';
}
</script>
</head>
<body>
<h3>编辑分类</h3>
<form action="test.php" method="post">
     名称:<input type="text" id="name" name="cname" /> 添加到:<?=makeSelect($category,'pid')?><br />
     <input type="hidden" id="op" name="op" value="add" />
     <input type="hidden" id="cid" name="cid" />
     <input type="submit" value="Submit" />
</form>
<h3>移动分类</h3>
<form action="test.php" method="post">
     <?=makeSelect($category,'who')?>移动到:<?=makeSelect($category,'to')?>
     <input type="hidden" id="op" name="op" value="move" />
     <input type="submit" value="Submit" />
</form>
<ul>
<?php
//Display the tree
foreach ($category as $id){
    echo '<li>'.$tree->getLayer($id, '|－ ').$tree->getValue($id).' <a href="test.php?op=del&cid='.$id.'">Del</a> <a onclick="mod('.$id.')">Edit</a> </li>';
}
?>
</ul>
</body>
</html>

[一把编程的菜刀]

呵呵，这个是网上相对比较流行的一个算法

[cyxin2121921]

mark

[iceman1983]

很好

[renqiang_888]

这两种形式不太能理解，请 chinmo
指点:

public $child = array(-1=>array());
public $layer = array(-1=>-1);

[renqiang_888]

chinmo
发的程序我没有仔细看，不过按照流程测试好像不行啊？大家有没有测试啊？请指点一下，谢谢了

[总哈哈]

把数据库规划好了，很好排序的，可惜我的域名没备案，给关了，要不然可以去我的blog上去看了！

[tottyandbaty]

array( [key =>]
value
, ...
)
// key 可以是 integer 或者 string
// value 可以是任何值

key 可以是 integer 或者 string。如果键名是一个 integer 的标准表达方法，则被解释为整数（例如 "8" 将被解释为 8，而 "08" 将被解释为 "08"）。key 中的浮点数被取整为 integer。PHP 中没有不同的数字下标和关联下标数组，数组的类型只有一种，它可以同时包含整型和字符串型的下标。

[renqiang_888]

唉，根本不能用啊？

[一把编程的菜刀]

可以用的啊
数据库结构我都给你贴上了啊

[kehao0416]

哪位高人给解释解释...

[renqiang_888]

哪位高人给解释解释...

[一把编程的菜刀]

。。。汗！
别说 你还不明白

[mikespook]

http://bbs.chinaunix.net/viewthread.php?tid=210903

无限分类，已经从月经帖演化成日经帖了～～

[kehao0416]

楼上的链接打不开啊

[van_glm]

用左右ID,不用递规

[van_glm]

用左右ID,不用递归

[海诗美妆]

lz应该是被憋在设计模式上了吧？
给你一个一劳永逸的冬冬：
[PHP设计模式]Composite(组合)模式范例

[zilingzhi]

其实我觉得无限分类是浪费 最多分到第五类已经分不下去了。
最有效率的是《PHP+MYSQL八大WEB动态实例》中的方法，是个美国人写的，在其中他示例了商品分类包括CMS后台管理系统的分类。很简单也很实用，根本就不用到类，楼主可以去借鉴一下。

[kondong]

刚看了楼上介绍的《PHP+MYSQL八大WEB动态实例》，确实很简单、实用，缺点就是灵活性稍差。