帐户软件

一个很好的矩阵类，使用者用了请务必感谢原作者-a good matrix type, users spent Be sure to thank the original author! !

堆栈的应用及操作 利用堆栈实现对任意进制的数的转换；-stack

两列双向链表相同值查询设计： 实现内容：构建两个双向链表，能够根据第一个链表中的值查询在第二个链表中的相同值的位置-2 bi-directional value chain the same query design: the realization of content: To construct two two-way linked list, according to the first list of values query in the second list value in the same position

este archivo permite la creacion de formularios de forma dinamica, ademas obtener su valor y gurdarlo en una base de datos

站长以前写的informix通用开发包源码，用c和ec编写-common code for infomrix,c and ec

dbf文件的读写类。它直接对dbf文件进行文件级的操作，没有索引-dbf file reader category. It has a direct right dbf files document-class operations and the absence Index

每一个参加排列的数据对应二叉树的一个结点，且任一结点如果有左（右）子树，则左（右）子树各结点的数据必须小（大）于该结点的数据。中序遍历排序二叉树即得排序结果。-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.

严蔚敏的数据结构各章接的主要算法c语言的代码实现,都能上机通过-the data structure of the next major chapter algorithm c language code to achieve, will be able to pass

源代码，是java实现的，比较清晰和第一部分一起的-Source code, is a java implementation to compare with the clarity and the first part of the

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.