/**
* 使用方法:
1.生成一个新的树对象 var tree = new tree();
2.生成一个新的根对象 var root = new root(1,"根目录","#","");
3.为树对象添加根对象 tree.addRoot(root);
4.为树对象添加节点,节点的顺序应该按id先后来排列
5.画出根对象 tree.drawRoot();
6.画出整个树 tree.drawNodes(tree.root);
例子:
<HTML>
<HEAD>
<TITLE>fff</TITLE>
<META http-equiv=Content-Type content="text/html; charset=gb2312"><SCRIPT language=javascript>
function onclick_alert()
{
alert("对不起!您没该权限!");
}var onecount;
onecount=0;
var topid=000000;
company = new Array(); company[0] = new Array("aa","000000","000001"); company[1] = new Array("bb","000000","000021"); company[2] = new Array("cc","000000","010000"); company[3] = new Array("dd","010000","010001"); company[4] = new Array("ff","010000","010002"); company[5] = new Array("gg","000000","011000"); company[6] = new Array("ee","011000","011001"); company[7] = new Array("hh","000000","012000"); company[8] = new Array("ii","000000","013000"); company[9] = new Array("kk","000000","014000"); company[10] = new Array("jj","000000","015000"); company[11] = new Array("mm","000001","016001"); company[12] = new Array("nn","000001","017002");onecount=13;
</SCRIPT>
<script src="script/FKtree.js"></script>
</HEAD>
<BODY>
<TABLE height="100%" cellSpacing=0 cellPadding=0 width="100%" border=0>
<TR>
<TD width="100%">
<script type="text/javascript">
var i=24;
var n=70;
var j;
var k;
var tree = new tree();
var root = new root(1,"center","#","");
tree.addRoot(root);
tree.addNode(new node(2,"system",1,"folder","#",""));tree.addNode(new node(24,"dept",2,"folder","#",""));
for(j=0;j < onecount; j++){
if (company[j][1] == topid){
i++;
tree.addNode(new node(i,company[j][0],24,"folder","index.jsp?topid="+company[j][2]+"&dept="+company[j][0],""));
for(k=0;k < onecount; k++){
if (company[k][1] == company[j][2]){
n++;
tree.addNode(new node(n,company[k][0],i,"file","index.jsp?topid="+company[k][2]+"&dept="+company[k][0],""));
}
}
}
} tree.addNode(new node(3,"abc",2,"file","admin/opmain.jsp","")); tree.addNode(new node(4,"ddfdfd",2,"file","admin/queryRole.jsp","")); tree.addNode(new node(5,"asfd",2,"folder","#",""));
tree.addNode(new node(6,"fdsg",5,"file","#",""));
tree.addNode(new node(7,"sgdsfds",5,"file","#","")); tree.addNode(new node(11,"dfsg",1,"file","#",""));
tree.addNode(new node(12,"fdsg",1,"file","#","")); tree.addNode(new node(19,"fsdg",1,"folder","#",""));
tree.addNode(new node(20,"gfggf",19,"file","#",""));
tree.addNode(new node(21,"fdgsfdg",19,"file","#","")); tree.addNode(new node(22,"ddfdf",1,"file","#",""));
tree.drawRoot();
tree.drawNodes(tree.root);
</script>
</TD>
</TR>
</TABLE>
</BODY>
</HTML>
* 使用方法:
1.生成一个新的树对象 var tree = new tree();
2.生成一个新的根对象 var root = new root(1,"根目录","#","");
3.为树对象添加根对象 tree.addRoot(root);
4.为树对象添加节点,节点的顺序应该按id先后来排列
5.画出根对象 tree.drawRoot();
6.画出整个树 tree.drawNodes(tree.root);
例子:
<HTML>
<HEAD>
<TITLE>fff</TITLE>
<META http-equiv=Content-Type content="text/html; charset=gb2312"><SCRIPT language=javascript>
function onclick_alert()
{
alert("对不起!您没该权限!");
}var onecount;
onecount=0;
var topid=000000;
company = new Array(); company[0] = new Array("aa","000000","000001"); company[1] = new Array("bb","000000","000021"); company[2] = new Array("cc","000000","010000"); company[3] = new Array("dd","010000","010001"); company[4] = new Array("ff","010000","010002"); company[5] = new Array("gg","000000","011000"); company[6] = new Array("ee","011000","011001"); company[7] = new Array("hh","000000","012000"); company[8] = new Array("ii","000000","013000"); company[9] = new Array("kk","000000","014000"); company[10] = new Array("jj","000000","015000"); company[11] = new Array("mm","000001","016001"); company[12] = new Array("nn","000001","017002");onecount=13;
</SCRIPT>
<script src="script/FKtree.js"></script>
</HEAD>
<BODY>
<TABLE height="100%" cellSpacing=0 cellPadding=0 width="100%" border=0>
<TR>
<TD width="100%">
<script type="text/javascript">
var i=24;
var n=70;
var j;
var k;
var tree = new tree();
var root = new root(1,"center","#","");
tree.addRoot(root);
tree.addNode(new node(2,"system",1,"folder","#",""));tree.addNode(new node(24,"dept",2,"folder","#",""));
for(j=0;j < onecount; j++){
if (company[j][1] == topid){
i++;
tree.addNode(new node(i,company[j][0],24,"folder","index.jsp?topid="+company[j][2]+"&dept="+company[j][0],""));
for(k=0;k < onecount; k++){
if (company[k][1] == company[j][2]){
n++;
tree.addNode(new node(n,company[k][0],i,"file","index.jsp?topid="+company[k][2]+"&dept="+company[k][0],""));
}
}
}
} tree.addNode(new node(3,"abc",2,"file","admin/opmain.jsp","")); tree.addNode(new node(4,"ddfdfd",2,"file","admin/queryRole.jsp","")); tree.addNode(new node(5,"asfd",2,"folder","#",""));
tree.addNode(new node(6,"fdsg",5,"file","#",""));
tree.addNode(new node(7,"sgdsfds",5,"file","#","")); tree.addNode(new node(11,"dfsg",1,"file","#",""));
tree.addNode(new node(12,"fdsg",1,"file","#","")); tree.addNode(new node(19,"fsdg",1,"folder","#",""));
tree.addNode(new node(20,"gfggf",19,"file","#",""));
tree.addNode(new node(21,"fdgsfdg",19,"file","#","")); tree.addNode(new node(22,"ddfdf",1,"file","#",""));
tree.drawRoot();
tree.drawNodes(tree.root);
</script>
</TD>
</TR>
</TABLE>
</BODY>
</HTML>
解决方案 »
免费领取超大流量手机卡,每月29元包185G流量+100分钟通话, 中国电信官方发货