计算机编程艺术第一卷，学习算法和数据结构的好书

以邻接矩阵作为图的存储结构，根据键盘输入创建图，并深度优先、广度优先遍历该图-matrix as to the adjacent storage structure of the plan, according to the keyboard input to create map and depth of priority, breadth priority traversal of the plan

每一个参加排列的数据对应二叉树的一个结点，且任一结点如果有左（右）子树，则左（右）子树各结点的数据必须小（大）于该结点的数据。中序遍历排序二叉树即得排序结果。-Order to participate in each of the data corresponding to a binary tree node, and any one node if there is left (right) subtree, then the left (right) subtree of the data node must be small (large) in the node data. Order traversal of binary tree that is the result of a sort.

二叉树的基本操作-binary tree as the basic operation

数据结构 数据结构 数据结构 数据结构 -data structure data structure data structure data structure data structure data structure data structure data structure data structure

MATHEMATICA 软件运用 最小生成树的Kruskal算法-MATHEMATICA software application of the Kruskal minimum spanning tree algorithm

一个经典的数据结构的实现-a classic of the data structure to achieve

该程序能够实现傅立叶的快速转换和放转换用vb语言来实现，整体效果不错！-the procedures to achieve fast Fourier transformation and the conversion put vb language used to achieve the overall effect was excellent!

是一个在学习数据结构时编写的图结构，主要是用两种方法生成需要的图结构，其中有一个头文件都注释了，要是要使用的话，只需要将另一个头文件注释并把这个取消注释，在main方法中改一个类名就好了-Is a data structure in the learning plan to prepare the structure, is mainly used two methods to generate the need for the graph structure, in which there is a header file are annotated, if you want to use words, just another header file to the Notes and the cancellation of Notes, in the main method to a class name like the

商品交易管理数据库-commodity transaction management database

不错的代码 希望大家喜欢 别忘了看完以后联系我 -good code hope you like do not forget to contact me after reading