在界面上动态显示出哈夫曼树及其生成过程 Javascript 源代码.docx

在界面上显示出哈夫曼树及其生成过程的Javascript 源代码：Index：var Huaffman = {gloable : 7000,data : [],//输入的权值存放数组numdivList : [],//把生成的圆存放到该数组cxt : document.getElementById(showCanvas).getContext(2d),cxt2 : document.getElementById(mapCanvas).getContext(2d),timer : 0,oldnumdivList : [],//右边圆的存放位置nextnumdivList : [],//donenumdivList : [],//用来存放parentBox实例lineList : [],mapList : [],allCanvas : [],//newData : null,//两权值相加后的数值level : 0,//init : function(){this.initMap();},initMap : function(){//生成地图for(var i=0;iMapData.length;i++){var mapX = [];for(var j=0;j26;j++){var newMap = new Map(this.cxt2,25+j*40,30+i*40,20,rgba(0,0,0,0));mapX.push(newMap);}this.mapList.push(mapX);}drawMap();},initData : function(){//取到输入权值var me = this;me.data = $(#inputValue).val().split(,).sort(function(a,b){return a-b});//console.log(me.data.length)me.initDiv();},initDiv : function(){this.clear();this.numdivList = [];this.lineList = [];this.oldnumdivList = [];this.donenumdivList = [];for(var i=0;ithis.data.length;i++){var numDiv = new Numdiv(this.cxt,this.data[i],25,i,String.fromCharCode(i+65));//初始化一个圆this.numdivList.push(numDiv);this.oldnumdivList.push(numDiv);}//this.oldnumdivList.sort(function(a,b){return parseInt(a.data)-parseInt(b.data);});drawNumdiv();},addData : function(data1,data2){this.oldnumdivList.shift();this.oldnumdivList.shift();this.newData = parseInt(data1.data) + parseInt(data2.data);if(this.data.length == this.oldnumdivList.length+2){data1.nextPosition = {cols:5,level:15};data2.nextPosition = {cols:7,level:15};this.nowList = new ParentBox(new Date().getTime(),null,[data1,data2],[],0,0);this.donenumdivList.push(this.nowList);//把生成的树放到这个数组}else{this.donenumdivList.sort(function(a,b){return a.headNode.cols-b.headNode.cols;});//生成的树按位置排序if(!data1.tag data2.tag){for(var i=0;ithis.donenumdivList.length;i++){if(this.donenumdivList[i].id == data1.parentId){this.nowList = this.donenumdivList[i];//确认了生成的父节点位置的树，并把它赋给nowList}else{this.donenumdivList[i].changeCols = 0;}}data1.nextPosition = {cols:this.nowLi