the data structure of a curriculum design, calculation of one yuan sparse matrix...

用C++写的寻找公共祖先，实现树的先序后序中序层次遍历，内有实验报告可以参阅。-C wrote for the public ancestors, the first realization of the tree sequence after sequence traversal sequence level, there are experimental report can be found.

最短路径的具体实现，使用了dikstra算法-Concrete realization of the shortest path, using the algorithm dikstra

音像制品销售管理 音像制品销售管理-Audio and video products audio and video products sales management sales management sales management audio and video products

数据结构算法，aoe ，图的最小代价路径检索。-data structure algorithms, aoe, for the minimal cost path retrieval.

这是最好的考试系统，内容是太短。注意请： 代码没有很好的描述将被删除，你不会得到任何点。请描述更好地获得更多积分。

数据结构示例。适用于对数据结构有一定基础的人研究练习-Examples of data structure. Data structure suitable for a certain practice-based studies

我的本科毕设，考试成绩处理系统，内含使用说明及源代码-complete my undergraduate established, the system of examination results, containing descriptions and the use of source code

在线视频流，并将其转换为mp3格式的音频文件。这个项目是在PHP框架下开发的。

红黑树：输入：在同一目录下的redblacktree.txt文件中输入十个大于0的数值，每个数值中间用空格格开 数目可以大于十个，但是要求在源程序中改变＃define NUM 10 ，改成相应关键值各个数输出：按照先序输出红黑树，格式为：根节点。颜色（左子树。颜色，右子树。颜色），并输出此 树的黑高度，然后输入要删除的关键值，按回车后输出删除后的结果，并输出其高度。-RED-BLACK TREE : Admission : in the same directory under the file input redblacktree.txt greater than 0 10 digits each intermediate numerical grid with open spaces can be greater than the number 10, but requested change in the source# define NUM 10, the corresponding critical value into several different output : In accordance with the first sequence RED-BLACK TREE output format : nodes. Color (left subtree. Color, right subtrees. Color), and export of the black tree height and then delete the key to value, according to enter the output was the result of the deletion, and its high output.

图论常用算法的C语言程序,对于图论的一些应用有很大的指导作用!-Graph theory algorithm commonly used C-language program, for some applications of graph theory has a great guide!