实现如何上传图片等数据，并存储其至数据库的源码

数据结构中图的相关操作,数据结构中图的相关操作-data structure of the plan related operations, data structure of the plan related to operation

该程序能实现的功能，若活动图有回路则无法计算出关键路径，即解决了判断工程的可行性问题。通过对工程活动的输入，可以建立任意的AOE网进行判断。对于输入的网，可以计算出每个活动的最早开始时间，最迟开始时间和全工程可以完成的最早时间，并找出关键路径和关键活动。-the program can achieve the functional, if a circuit map activities can not be calculated critical path, that is a judgment to resolve the feasibility of the project. Right through the importation of construction activities, we can establish arbitrary judgment AOE network. The network for the importation can be calculated for each of the earliest start time, the latest starting time and the entire project will be completed in the first time, and identify key and critical path activities.

这是一个旅行商问题的算法源程序，代码较为简短，说明详细，可读性好。压缩包里面只包含源程序文件，要在vc上面运行。-This is a traveling salesman problem algorithm source code, code brief that detailed and readable. Compressed they contain only source files to run above the vc.

汉诺塔代码,从第一个木桩中,把所有盘子从大到小搬移到第三个木桩中.-HANOR code from a wooden blocks, all the dishes to the smallest movement pickets were third.

应用背景这是一个用定时器来处理网上考试的示例代码。你可以在文件上面指定的JavaScript文件的时间。在这里声明全局变量为计时器。设置时间。关键技术数据库：1。创建一个空数据库命名为testexam或如果你想要不同的然后你可以当执行你所设置的数据库的名称查询。2。执行该项目所附的查询。3。在表中添加至少10个问题和答案。4。必须在正确的字段中指定选择号码。例如： ；如果你的答案是选项设置为1。

北大ACM1005(I Think I Need a Houseboat)-North ACM1005 (I Think I Need a Houseboat)

经MMX, SSE 2优化后的MEMCPY,比VC中的MEMCPY快不少-as MMX, SSE, SSE2 optimization of MEMCPY than the VC lot faster MEMCPY

Addison-Velski 和 Landis (AVL-Tree s)的二叉树，可以在对数时间内进行标准的操作，如插入、搜索和删除。-Addison-Velski and Landis (AVL- Tree s) of the binary tree, the right time for a few of the standard operation, such as insert, delete and search.

数据结构演示系统-data structure Demonstration System

oracle问题集，适合初学者-problem sets, suitable for beginners