| 算法可视化的分析与应用 |
| |
| 引用本文： | 温春,石昭祥.算法可视化的分析与应用[J].兵工自动化,2006,25(1):89-90. |
| |
| 作者姓名： | 温春 石昭祥 |
| |
| 作者单位： | 解放军电子工程学院,计算机应用教研室,安徽,合肥,230037;解放军电子工程学院,计算机应用教研室,安徽,合肥,230037 |
| |
| 摘 要： | 算法可视化由静态和动态算法可视化组成.其中Huffman算法可视化为二叉树构造算法,流程含单步执行、显示节点图形及再次构造.按程序设置单步构造功能,每一步构造一个结点.即当用户选择单步构造时,先运行到上一单步构造结点的下一个结点位置,构造一个结点,保存当前环境变量后返回并阻止执行下一步结点构造.程序对于每一结点均设置显示标志,每次显示结点时需要对相关联结点的显示标志加以判断,分别对待处理.
|
| 关 键 词： | 算法可视化 Huffman算法 二叉树构造算法 |
| 文章编号： | 1006-1576（2006）01-0089-02 |
| 收稿时间： | 2005-07-25 |
| 修稿时间： | 2005-08-30 |
Analysis and Application of Algorithm Visualization |
| |
| WEN Chun,SHI Zhao-xiang.Analysis and Application of Algorithm Visualization[J].Ordnance Industry Automation,2006,25(1):89-90. |
| |
| Authors: | WEN Chun SHI Zhao-xiang |
| |
| Affiliation: | Staff Room of Computer Application, Electronic Engineering Institute of PLA, Hefei 230037, China |
| |
| Abstract: | The algorithm visualization is composed of the static and the dynamic algorithm visualization. Huffman algorithm visualization is the B-tree construction algorithm, and the flow contains single step execution, the node graph display and reconstitution. When users selected the single step construction mode, the system ran to the front step node to construct a node and the current environment parameters were stored at the same time, then return. Each node would be set display mark by program. When nodes were displayed, the relative marks were judged and treated separately. |
| |
| Keywords: | Algorithm visualization Huffman algorithm B-tree construction algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
