c language data structure, you can use a free download without registration

数据结构算法，稀疏矩阵的存储，两矩阵相乘，两矩阵相加的实现-data structure algorithms, sparse matrix storage, two matrix multiplication, the sum of two matrix to achieve

Moodle 是一个开源免费的电子学习网站。 简单下载 moodle 安装它...... 在你的 htdocs...... & 使用它在多个方面......访问作为老师经理、 学生、 部门首长和管理员...

这是一个分治解决的零件切割问题:给定一块宽度为W的矩形板，矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi，宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。问如何切割使得所使用的矩形板的高度h最小？加上一个小界面-This is a solution to the partition cutting parts : a given width of the rectangular plate W, the height of rectangular plate unrestricted. Board is required from the respective cut out n height of the hi, wi width of the rectangular parts. Cutting parts to the rules of the height of the rectangular plate with a high degree of consistent direction. Asked how cutting makes use of the rectangular plate height h minimum? A small interface

最短路径方法The shortest path method-The shortest path method

系统说明:这是一个应用数据库系统VFP开发的酒店管理系统.-system Note : This application is a database system developed by VFP hotel management system.

VFP的ERP的管理软件,源代码完整,位图自己布充下吧-VFP ERP management software, the source code integrity, bitmap filling their cloth under it

图的建立和图的广度深度优先遍历（有向图和无向图）-Map creation and map the breadth of depth-first traversal (with the map and undirected graph)

一个效率很高的通配符查找算法，适用于对"*"和“?”的通配符查找，可以根据需要进行修改，适用于不同应用， 另外还有一个非常适用的CRC检查算法-a highly efficient wildcard search algorithm that applies to the "*" and "the" wildcard search, it may need to make changes apply to different applications, there is another very applicable CRC check algorithm

数据结构中的二叉树排序问题-data structure, the binary sequencing problem

(一) 编写一个程序LAGO7-1.CPP，实现二叉树的各种运算，并在此基础上设计一个主程序完成如下功能。 （1） 输出二叉树B； （2） 输出二叉树B的深度； （3） 输出H结点的左、右孩子结点值； （4） 输出二叉树B的宽度； （5） 输出二叉树B的结点个数； 输出二叉树B的叶子结点个数 -(A) to prepare a program LAGO7-1.CPP, to achieve a variety of binary operations, and on this basis, design a main program performs the following functions. (1) output binary tree B (2) The output of a binary tree B of depth (3) The output of H nodes left and right child node value (4) outputs a binary tree B, width (5) output node B, the number of binary trees (6) outputs a binary tree B, the number of leaf nodes