文件中是我编写的两个数据结构，线性表列和链表，是用类模版函数编写，是面向过程设计...

连接labview与数据库的桥梁,labsql免费工具包-LabVIEW and the database to connect the bridge, labsql free toolkit

本人制作的8位CPU,有简单的加减,输入,输出操作,希望大家好用-I produced eight CPU, has a simple addition and subtraction, input and output operations, I hope everyone use

UTE - (U)niversal ASP (T)able (E)ditor 万能数据管理（管理后台）-oldest- (U) niversal ASP (T) able (E) Editor omnipotent data management (management background)

train reservation in visual basic

这是一个基于OPENCV,寻找运动目标轮廓，以实现视频流的运动目标检测为目的Delphi例子。 并带有Delphi与OpenCv的编程接口。-This is based on OPENCV, search for moving object silhouette in order to achieve video streaming of moving target detection for the purpose of Delphi examples. OpenCv with Delphi and the programming interface.

给定n 个整数a ,a , ,an 1 2  组成的序列， a n i | |£ ，1 £ i £ n。如果对于i £ j ，有 0 = å = j k i k a ，则称序列区间i i j a , a , , a +1  为一个零和区间，相应的区间长度为j-i+1。-given n integers a, a, and an 1 2

离散01串问题，(n,k)01 串定义为：长度为n 的01 串，其中不含k 个连续的相同子串。对于给定的正整数n 和k，计算(n,k)01 串的个数。-discrete series of 01 questions, and (n, k) 01 Series : the definition of the length of n strings of 01, which is non-consecutive k-the same string. For a given positive integer n and k, calculated (n, k) 01 series of numbers.

利用克鲁斯卡尔算法求边集数组GE所示图的最小生成树-Order to Kruskal algorithm using an array of GE edge set of minimum spanning tree as shown in Figure

ｃ＃语言快速入门基础代码带注释，主要是针对那些对C#想快速入门的人并且有一定的C++基础的人提供的，快如懂得C#的基本语句和面向对象的基本思想。

数据结构中实现图的关键路径的算法，是在TC中运行的。-data structure to achieve the critical path map algorithm is run in the TC.