数据结构表达式求值

客户关系管理系统,可以进行一些简单的客户关系管理

建立赫夫曼树，然后再由叶子到根实现赫夫曼编码。-Huffman tree set up, and then leaves to the root by the Huffman encoding implementation.

《数据结构》配书光盘 内容包括：线性表，栈和队列，串，数组与广义表，树，图，查找，排序等所以算法。 该光盘中配有《数据结构》一书中的所有算法、每一个算法的 C 程序（后缀为 .cpp 的文件）及可执行文件（后缀为 .exe 的文件）。-"data structure" assigned CD include : linear table, stack and queue, strings, arrays and broad scale tree, map, search, sort, etc. So algorithm. The CD-ROM equipped with a "data structure," a book of all the algorithm, the algorithm for each one C (suffix. Cpp files) and the executable file (wayward. Exe files).

表达式求值算法

是数据结构书上的算法，都是比较经典的实现。-data structure is the book algorithm, which is a more classic realized.

森林状的关系图，用java实现的森林状的关系图-forest from the map, using java for the forest-like diagram

一种基于二维链表的稀疏矩阵模半板类设计 A template Class of sparse matrix. Key technology: bin,2-m linked matrix. constructors: 1.normal constuctor 2.copy constuctor. 3.assignment constructor. Basic operator: 1. addition(sub) of two matrix 2. inverse of a matrix. 3. multiply of two matrix. etc.-based on two-dimensional chain of sparse matrix model semi-plate design of Class A"s template parse matrix. Key technology : bin. 2-m linked matrix. constructors : 1.normal constuctor 2.copy constuctor. 3.ass ignment constructor. Basic operator : 1. addition (sub) 2 matrix of two. inverse of a ma trix. 3. multiply of two matrix. etc

设计邻接表类,实现无向图的深度优先非递归遍历,无向图的广度优先遍历,并设计主函数输入数据进行测试-Design category adjacency list, realize undirected graph of the depth-first traversal non-recursive, non-directed graph breadth-first traversal, and the design of the main function of the input data for testing

最近邻搜索算法，k_tree算法的大部分中文文献-Nearest neighbor search algorithm, k_tree algorithm for most of the Chinese literature

java常用的排序算法源码，从最基本的冒泡排序到快速排序，基排序等各种实现 -commonly used sorting algorithm java source code, from the most basic to the Quick Sort Bubble Sort, sort, etc. to achieve the base