few labwindows/CVI the database example, Now give us a, I would like to thank my...

一个数据结构的课程设计-a data structure of the curriculum design

约瑟夫环的数据结构算法 ＶＣ＋＋６．０实现-Josephus algorithm data structure VC++ 6.0

为了给世纪互联做一个项目，从淘宝指数上抓取的全国省市经纬度坐标，非常好用。附赠全国动态地图示例demo。由于资源是动态引入的，不能file直接访问，要布再www服务器

数据库辅助工具帮助数据库管理以及程序开发者提高效率的小工具源码。SQL Tools工具有可能不被系统支持 的解决办法 如果系统没有安装数据库或者缺少相关组件，可能会导致程序不能正常工作！在源码中没有附带解决方法，这个是我的疏忽。一下补上内容：SqlTool补丁使用方法：第一步：首先将msvcr71.dll, ?SQLDMO.DLL,拷贝到C:Program FilesMicrosoft SQL Server80ToolsBinn目录。?第二步：打开开始，在运行中输入 regsvr32 "C:Program FilesMicrosoft SQL Server80ToolsBinnsqldmo.dll" 注册sqldmo.dll。问题解决组件下载链接：http://pan.baidu.com/s/1zN21v 

(1)输入E条弧,建立AOE-网的存储结构 (2)从源点v出发,令ve[0]=0,按拓扑排序求其余各项顶点的最早发生时间ve[i](1=2). (4)根据各顶点的ve和vl值,求每条弧s的最早发生时间e(s)和最迟开始时间l(s).若某条弧满足条件e(s)=l(s),则为关键活动.-(1) E importation of Arc lt; J, kgt; Establish AOE- network storage structure (2) v starting point source, ve [0] = 0, by topological sorting point for the rest of the earliest timing ve [i] (1LT ; = ilt; = n-1). if the Topography vertex orderly sequence number is less than net n vertices, a statement that net presence in Central, not for Critical Path, algorithm implementation steps to terminate or (3) (3) from the Department of v starting point, Vl [n-1] = ve [n-1], by the inverse order for the remaining topology of the latest occurrence of peak time Vl [i] (n-inversion; = IGT; = 2). (4) According to the apex of ve and Vl value for each s arc of the earliest timing e (s) and the latest starting time

数据结构关于多项式相加的源码-the soundcode of data-structure on the additon of the polynomals.

this is my first software.

链表程序，新版！关于数据结构-Chain procedures, the new version! On the data structure

用c＋＋写的用于ic设计中布图布线的工具源码，采用btree结构，包含文档-using c++ to write for ic design layout source routing tools used btree structure, including documentation

很精典的与数据库连接的管理程序-very classic and the database connection management process