我的所有數據都在我的數據庫中。它有以下4列Java或php樹形結構問題
id source_clust target_clust result_clust
1 7 72 649
2 9 572 650
3 649 454 651
4 32 650 435
這個數據就像樹結構。 source_clust和target_clust生成target_clust。 target_clust可以是source_clust或target_clust來創建一個新的target_clust。有沒有 任何PHP函數或類，我可以用它來爲我的數據生成樹結構？
我看到這個MySql網站，他們正在做我所需要的，但我無法找到如何在我的數據中實現該查詢 。
謝謝！
編輯
有沒有在Java中沒有辦法做到這一點？如果我們在數組中有相同的數據？
您可以從phpclasses.org下載PHP樹（或者甚至是binary tree）類，然後您可以使用腳本將數據庫中的數據填充到樹中。你會有更多的獨立部分，因爲你有更多的根。在你寫的情況下，你將有2根：651和435
[...]
$tree = new Tree();
$strsql = "SELECT source_clust, target_clust, result_clust FROM mytable";
$ressql = @mysql_query($strsql);
while(list($v1, $v2, $v3)[email protected]_fetch_array($ressql))
{
if (!$tree->hasNode($v1))
$tree->newNode($v1);
if (!$tree->hasNode($v2))
$tree->newNode($v2);
if (!$tree->hasNode($v3))
$tree->newNode($v3);
$tree->Node($v1)->parent = $tree->Node($v3);
$tree->Node($v2)->parent = $tree->Node($v3);
}
@mysql_free_result($ressql);
這是完整的代碼我用來建立一個二叉樹數據結構及其相應的操作：
<?php
class Node
{
public $data;
public $leftChild;
public $rightChild;
public function __construct($data)
{
$this->data=$data;
$this->leftChild=null;
$this->rightChild=null;
}
public function disp_data()
{
echo $this->data;
}
}//end class Node
class BinaryTree
{
public $root;
//public $s;
public function __construct()
{
$this->root=null;
//$this->s=file_get_contents('store');
}
//function to display the tree
public function display()
{
$this->display_tree($this->root);
}
public function display_tree($local_root)
{
if($local_root==null)
return;
$this->display_tree($local_root->leftChild);
echo $local_root->data."<br/>";
$this->display_tree($local_root->rightChild);
}
// function to insert a new node
public function insert($key)
{
$newnode=new Node($key);
if($this->root==null)
{
$this->root=$newnode;
return;
}
else
{
$parent=$this->root;
$current=$this->root;
while(true)
{
$parent=$current;
//$this->find_order($key,$current->data);
if($key==($this->find_order($key,$current->data)))
{
$current=$current->leftChild;
if($current==null)
{
$parent->leftChild=$newnode;
return;
}//end if2
}//end if1
else
{
$current=$current->rightChild;
if($current==null)
{
$parent->rightChild=$newnode;
return;
} //end if1
} //end else
}//end while loop
}//end else
} //end insert function
//function to search a particular Node
public function find($key)
{
$current=$this->root;
while($current->data!=$key)
{
if($key==$this->find_order($key,$current->data))
{
$current=$current->leftChild;
}
else
{
$current=$current->rightChild;
}
if($current==null)
return(null);
}
return($current->data);
}// end the function to search
public function delete1($key)
{
$current=$this->root;
$parent=$this->root;
$isLeftChild=true;
while($current->data!=$key)
{
$parent=$current;
if($key==($this->find_order($key,$current->data)))
{
$current=$current->leftChild;
$isLeftChild=true;
}
else
{
$current=$current->rightChild;
$isLeftChild=false;
}
if($current==null)
return(null);
}//end while loop
echo "<br/><br/>Node to delete:".$current->data;
//to delete a leaf node
if($current->leftChild==null&&$current->rightChild==null)
{
if($current==$this->root)
$this->root=null;
else if($isLeftChild==true)
{
$parent->leftChild=null;
}
else
{
$parent->rightChild=null;
}
return($current);
}//end if1
//to delete a node having a leftChild
else if($current->rightChild==null)
{
if($current==$this->root)
$this->root=$current->leftChild;
else if($isLeftChild==true)
{
$parent->leftChild=$current->leftChild;
}
else
{
$parent->rightChild=$current->leftChild;
}
return($current);
}//end else if1
//to delete a node having a rightChild
else if($current->leftChild==null)
{
if($current==$this->root)
$this->root=$current->rightChild;
else if($isLeftChild==true)
{
$parent->leftChild=$current->rightChild;
}
else
{
$parent->rightChild=$current->rightChild;
}
return($current);
}
//to delete a node having both childs
else
{
$successor=$this->get_successor($current);
if($current==$this->root)
{
$this->root=$successor;
}
else if($isLeftChild==true)
{
$parent->leftChild=$successor;
}
else
{
$parent->rightChild=$successor;
}
$successor->leftChild=$current->leftChild;
return($current);
}
}//end the function to delete a node
//Function to find the successor node
public function get_successor($delNode)
{
$succParent=$delNode;
$successor=$delNode;
$temp=$delNode->rightChild;
while($temp!=null)
{
$succParent=$successor;
$successor=$temp;
$temp=$temp->leftChild;
}
if($successor!=$delNode->rightChild)
{
$succParent->leftChild=$successor->rightChild;
$successor->rightChild=$delNode->rightChild;
}
return($successor);
}
//function to find the order of two strings
public function find_order($str1,$str2)
{
$str1=strtolower($str1);
$str2=strtolower($str2);
$i=0;
$j=0;
$p1=$str1[i];
$p2=$str2[j];
while(true)
{
if(ord($p1)<ord($p2)||($p1==''&&$p2==''))
{
return($str1);
}
else
{
if(ord($p1)==ord($p2))
{
$p1=$str1[++$i];
$p2=$str2[++$j];
continue;
}
return($str2);
}
}//end while
} //end function find string order
public function is_empty()
{
if($this->root==null)
return(true);
else
return(false);
}
}//end class BinaryTree
?>
你會添加更多信息？我沒有跟隨。您談論源和目標羣集，但result_cluster在哪裏發揮作用？ – 2010-03-09 02:50:01
感謝您的輸入。這是agnes集羣輸出:)。因此，它將基於距離的源和目標相結合來生成結果集。如果還不清楚，請告知我 – user238384 2010-03-09 03:02:45
或者您可以說源和目標是結果的子結果，但結果也會是另一個結果列（MLM :)的子結果 – user238384 2010-03-09 03:08:39