《游戏之旅

该程序用贪心算法来求解最小生成树问题 采用贪婪准则：每次选择边权值最小边。如果该边加入后不构成环，则加入。-procedures with the greedy algorithm to solve the problem using the minimum spanning tree greedy guidelines : each side the right to choose the minimum value side. If the edge after the entry does not constitute a part, while accession.

详细阐述了网络中的最大流量的实现方法，并编写了实现算法。-Elaborated in detail on the largest network flow method and the preparation of the algorithm.

Easy Hide and Unhide your Folder (Security Medium)

日程提醒小工具 提示每日工作的内容 可以管理-everyday what you do

关于计算机安全的textbook，chm格式-On computer security textbook, chm format

网上商店设计与实现。应用ASP动态代码将查询结果现实在浏览器中解决购物车系统问题。 搜索引擎可以利用VBScript脚本语言连接数据库解决这一问题。-I don t know talk about this system ,but this is really a good system .and it can help you.

关于tsp问题的matlab程序，希望对大家有用 -tsp of the Matlab procedures in the hope that it may be useful to

用Witness2实现Miller-Rabin算法，主程序循环5―20次，看在100,000―200,000之间有多少个数被判为素数-With the Miller-Rabin algorithm to achieve Witness2, the main program loop 5-20 times, to see how many in number between 100,000-200,000 convicted of prime

打印出所有ASCII码的小程序-print out all the ASCII small programs

This program downloads and executes an arbitrary waveform, consisting of 32,000 points (maximum value is 64,000 points), to the Agilent 33220A. The waveforms can be downloaded as a comma separated list of double values (-1 to +1 full scale values) or integer values converted to definate length arbitrary block data. -This program downloads and executes an arbitrary waveform, consisting of 32,000 points (maximum value is 64,000 points), to the Agilent 33220A. The waveforms can be downloaded as a comma separated list of double values (-1 to+1 full scale values) or integer values converted to definate length arbitrary block data.