资源列表
VisualAssistX
- visual Assist 破解 visual Assist 破解-visual Assist 破解
vb2005monitor
- 一本非常实用的书visual basic 2005与自动化系统监控的源代码。-A very useful book visual basic 2005 system monitoring and automation of the source code.
TutorialGenerateDisplay1
- this file contains how to generate signal in labview
SignalLab
- C++ Builder 介面美化！SignalLab的使用教學。-C++ Builder GUI
ShoppingCart
- 简单的购物车程序源码，初学者必备源码。作为学习参考-shoppingcart
vcDEMO
- 实现进程之间内存共享，通讯。擦写内存。在不同的进程之间交换数据。-Achieve the shared memory between processes, communication. Erase the memory. In the exchange of data between different processes.
WebRoot
- 19种不同风格的导航下拉菜单!通过点击不同的连接显示不同的菜单-19 kinds of different styles of navigation drop-down menu
Logistics
- 物流管理项目源码，包含物流操作基础功能包含其中-Logistics management project source code, including the basic function of the logistics operation
apr-util-1.3.9-win32-src
- apr-1 util,开发第三方库，在secondlife中用到-apr-1 util
WebTest
- 网站建设基础设计项目代码，包含用户登录，注册，注销-Website Design Project-based code that contains the user login, registration, cancellation of
poj
- pku 3613 Cow Relays 题意：给一个无向图，求从起点s到终点e尽力n条边的路径最小值。 边的数量2<=t<=100(每条边可以重复遍历) 算法：利用dp求出 path[ l ] [ i ] [ k ]=MIN(path[ l ][ i ] [ k ] , path[ l ][ i ] [ j ] + path[ l ][ j ] [ k ]) l 表示的是2的指数，假设 i 到 k 要途径 2^l 条边，那么他可以被分为两段 途径2
Cplusplus
- 学习C++最好的资料，附带个人学习笔记注释！-Learning C++ the best information, with personal study notes notes!