数据结构代码，很好的资料

我已经寄给这个网站的数据库管理系统项目。这是对每个数据库管理员非常有用谁对此工作。这一项目被实施使用 java 服务器 page(JSP)

图论与网络论中求最短路径的Dijkstra算法-Graph theory and network theory for the Dijkstra shortest path algorithm

Computes estimates for the number of forests of a graph, input as a 0-1 incidence matrix. Notes: Compile in C++, "g++ -o span_forest span_forest.c". The program does not demand that the matrix is symmetric with 0 diagonal, but uses only the upper triangular part. -Computes estimates for the number of fores ts of a graph. input as a 0-1 incidence matrix. Notes : Compile in C, "g-o span_forest span_forest.c." The program does not demand that the matrix is symmetric wit h 0 diagonal. but uses only the upper triangular part.

1.本程序由本人采用vc++ 6.0编写，包括了排序平衡二叉树的整套算法（包括插入、删除、查找以及其测试算法）。 2.运行myavl_vc.exe输入树的初始结点个数，确定后本程序将在内存中生成一棵相应结点数的二叉树，在此基础上你可以进行各种操作（插入、删除、查找以及测试其平衡性、排序性等） 3.每一个结点信息包括"商品编码"、"商品名称",且以"商品编码"作为关键字 4.初始生成的树的结点的商品编码为从1按顺序递增，商品名称为"生成的商品"加上商品编码 5.程序中的随机插入与随机删除是为了更好的测试程序的正确性和可靠性 6.随机插入（删除）时，程序将不断向（从）树中随机插入（删除）结点，每次随机插入（删除）都会进行平衡性与排序性的检查，如果树已经失去了有序性或平衡性，则会弹出树已失去了有序性或平衡性的提示并停止插入（删除）操作，当然你可以随时中断随机操作-1. The procedure I used vc 6.0 preparation, including the sequencing of the entire balanced binary tree algorithm (including insert, delete, search and test algorithm). 2. Running myavl_vc.exe importation of the initial tree node number, the procedures established in the memory of the formation of a corresponding nodes of a binary tree, and on this basis you can conduct various operations (insert, delete, search and testing their balance, sorting etc.) 3. each node information including "Product Codes," "trade names," and the "commodity codes" as the keyword 4. initial produ

mysql 3.22源码-mysql 3.22 sources codes

AOV的拓扑排序算法-AOV topological sorting algorithm

严蔚敏老师的数据结构专贴。考研的朋友要好好看哦 是内部资料啊-Yan Wei Min teacher posted a data structure. Graduates to make good friends FACT internal information ah

VC下的ADO编程封装类。可灵活方便的应用于VC下的ADO编程-VC under the category ADO programming package. Flexibility can be applied to the VC under the ADO programming

这是一个关于打印技术的的源码，通过access数据库将数据打印到我们的所需清单上-This is a print technology on the source, access the database through the data required for printing to our list

通过对数据进行必要加工后的结果判断数据的存储方式，即，CPU的大端，小端-Through the data necessary to determine the results of processed data is stored, that is, CPU s big-endian, little-endian