data structure c

数据结构与算法-二叉树的用法。 二叉树的主要算法，声明等。-Data structures and algorithms- the usage of a binary tree. The main binary tree algorithm, statements.

在MS SQL Server数据库连接  java的学校管理系统；

里面有很多有用的公式，很有利于算法的学习，希望与大家一起分享-There are many useful formula for the learning algorithm

回溯法的模板，关键是回溯的过程，以及在深搜过程中的方向问题-Backtracking template, the key is back process, as well as in the course of the deep question of the direction search

用vfp实现的工资管理系统源码，可实现中小企业员工工资自动化管理。-Implemented using vfp salary management system source code, can realize automatic management of small and medium enterprises, wages and salaries.

有关启发式搜索的经典算法：A*最短路径算法的实例和对应程序。关注的朋友可以留意一下。（比传统的Dijistra算法效率高很多哦！^_^）-the heuristic search algorithm of the classic : A* shortest path algorithm examples and the corresponding procedures. Concerned friends can look. (Dijistra than the traditional algorithm efficiency is much higher oh 70,000

数据结构课程设计内部排序的比较 一共有十种排序方法-Curriculum design of internal data structure to sort of comparison a total of 10 kinds of sorting methods

用prim算法实验最小生成树 本程序中用到函数adjg( )，此函数作用是通过接受输入的点数和边数，建立无向图。函数prg( )用于计算并输出无向图的邻接矩阵。函数prim( )则用PRIM算法来寻找无向图的最小生成树 定义了两个数组lowcost[max],closest[max]，若顶点k加入U中，则令lowcost[k]=0。 定义二维数组g[ ][ ]来建立无向图的邻接矩阵。 -Prim algorithm using minimum spanning tree of the experimental procedures used in function adjg (), this function is through the acceptance of input points and edges, the establishment of a directed graph. Function of prg () used to calculate and output undirected graph of adjacency matrix. Function prim () is used PRIM Algorithm to find the undirected graph of the minimum spanning tree array defines two lowcost [max], closest [max], if it joined the U of k vertices, then the lowcost [k] = 0. The definition of two-dimensional array g [] [] to create a undirected graph of adjacency matrix.

有关于二差树的遍历，对于初学者有很大的帮助，-Worse on the second tree traversal, for beginners there are a lot of help,

VB 图书馆管理程序-VB library management procedures