Viterbi算法源程序,注释简洁,利于使用

该源代码为数据库设计的报刊订阅，和报告，挺详细的，适合初学者-The source code for the database design of newspapers and periodicals subscriptions, and reports quite detailed, suitable for beginners

实现了 web service得数据库查询，更新，删除得功能，简便耐用。-May realize a web service database query, update, delete a feature, simple and durable.

存储过程sql： create or replace procedure job_proc is begin --免费票状态修改 需修改ID update O_2413 set attr_24131004="作废" where attr_24131004="已售"; --普通票状态修改 需修改ID update O_2405 set attr_24051004="作废" where attr_24051004="已售"; --团体票状态修改 需修改ID update O_2412 set attr_24121004="作废" where attr_24121004="已售"; end; job的sql： declare   job number;   begin   dbms_job.submit(job, "job_proc;", sysdate, "TRUNC(SYSDATE + 1)");   end;

仓库管理系统VC源码 在运行程序之前，请将所附的数据库文件dms.mdb添加为数据源，并命名为DMS。-Warehouse Management System in VC-source operating procedures, I would be grateful if the attached document dms.mdb database to add data sources, and was named to the DMS.

该项目是利用SQL开发。它是专为存储是从所谓的zoneict..It网站发送具有相互关联的另一个50表中的数据。所以，如果你想知道如何使用SQL将HEP那么创建表试下。祝好运

实现多课程的排序问题，符合先修课程安排的要求，可给出多种排课方案！！本程序的亮点是可得出一组课程的所有可能的拓扑排序,故最终结果是多方案的-Scheduling multi-course meet the requirements of Pre-curriculum can be given a variety of arranging schedule the program! ! The highlight of this program can be drawn from a group of courses in all possible topological sort, so the end result is a multi-program! !

在visual studio 2010中使用c#.net登录页面，使用microsoft sql server 2008连接，连接字符串位于应用程序代码中，sql server数据位于live链接中。该代码已被用于用户登录使用多个设置，如管理员用户，最终用户等。，

北大OJ 1417题的标程代码，并查集和深度优先搜索的经典实现-OJ 1417 North title scalar-way code and search sets and the classic depth-first search to achieve

这是一个PB小程序　是实现模糊查询的.这是一个PB的小程序，实现模糊查询的 这是一个PB的小程序，实现模糊查询的-PB This a small program is vague inquiries. This a small program PB, Fuzzy inquiry, which is a PB of small programs to achieve fu zzy inquiry, which is a PB of small programs to achieve fuzzy inquiry, which is the one PB small program for the realization of fuzzy

prim算法是将一个无向图生成最小生成树的算法。其中一个是用最下堆实现的，已在压缩包的txt文件中说明。-prim algorithm is an undirected graph generated minimum spanning tree algorithms. One of them is the most under the heap to achieve, has been compressed package txt-documented.