静态sql详细介绍了数据库结构数据库相关的内容，重点介绍和解释了sql语言的使用...

随机输入n跳直线 利用增量算法 在一个方块区域内实现他的dcel图 利用opengl把效果图展示出来 -Stochastic input n-hop linear incremental algorithm in a box to use within the region to realize his plan to use opengl to dcel effect diagram displayed

数据结构中关于十字链表的实现，十字链表可以很好的对稀疏矩阵进行效率很高的存储和计算。比如在通信纠错编码的ldpc编译码中就要用到这种数据结构-data structure on the realization of Chain Cross, Cross List can be good for sparse matrix highly efficient storage and computing. For example, in communications-correction coding ldpc encryption it is necessary to use this data structure

一、数据库安装 《个人求职管理系统》使用MySQL数据库，请你先在你的数据库服务器上建立一个数据库，然后将你下载的程序解压缩后上传到你的网站空间下，接下来请将sql目录下的tdjob.sql文件导入你刚建立好的MySQL数据库中，导入的SQL文件会在数据库中新建两个数据表td_pjm_user和td_pjm_jobs。 注意：成功导入数据文件后，请修改lib目录下的config.jsp文件，该文件里包含了你的数据库连接信息，请进行相应的修改。 二、JavaBeans安装 将lib目录下的td文件夹拷贝到WEB-INF/classes目录下。td目录中有两个class文件，这两个文件的原Java文件你可以在lib目录下的source目录中找到。-a database installed "individual job search management system" using the MySQL database you, in your database server on the establishment of a database, then you download the procedures decompress after uploaded to your website space, then I would be grateful if sql directory of documents into your tdjob.sql just to establish good MySQL database, SQL file into the new database td_pjm_user two data tables and td_pjm_jobs. Note : Successful data into documents, please amend the lib directory config.jsp document, the document contains your database connection information, please amended accordingly. 2, JavaBeans lib directory will be installed under the td fo

address management vb6

它是一种软件，可以用于大型组织，追溯历史，很容易地更新员工信息及员工

这是传统智能优化背包问题用VC++ 6.0的实现，是对背包问题分支限界的可视化算法实现-This is a traditional intelligent optimization knapsack problem VC++ 6.0 with the realization of knapsack problem is the visualization of branch and bound algorithm

航空最短路径探测，VB调用D-aviation shortest path detection, call VB D

期末考试日程管理系统，代码免费公开，做的有点大，有4M多了，没办法功夫不到家-Final exam schedule management system, code free and open, doing a bit large, there are 4M more, no way to martial arts than at home

货郎担问题的分支限界算法，速度很快，并且结点可以到达35个-The branch and bound algorithm for traveling salesman problem, very fast, and the node can reach 35

ACCESS的源程序-code of access