这是一个基本的调查系统，可用于任何网站。

winsock文件传输，界面很漂亮哦，能够在客户端和服务器之间传输文件。-winsock file transfer, the interface is beautiful Oh, to the client and server to transfer files between.

归并和快速算法比较-merging and fast algorithm

matlab Manchest编码实现的m 文件-matlab Manchest coding realize the m file

[输入] 图的顶点个数N，图中顶点之间的关系及起点A和终点B [输出] 若A到B无路径，则输出“There is no path” 否则输出A到B路径上个顶点 [存储结构] 图采用邻接矩阵的方式存储。 [算法的基本思想] 采用广度优先搜索的方法，从顶点A开始，依次访问与A邻接的顶点VA1,VA2,...,VAK, 访问遍之后,若没有访问B，则继续访问与VA1邻接的顶点VA11,VA12,...,VA1M，再访问与VA2邻接顶点...，如此下去，直至找到B，最先到达B点的路径，一定是边数最少的路径。实现时采用队列记录被访问过的顶点。每次访问与队头顶点相邻接的顶点，然后将队头顶点从队列中删去。若队空，则说明到不存在通路。在访问顶点过程中，每次把当前顶点的序号作为与其邻接的未访问的顶点的前驱顶点记录下来，以便输出时回溯。 #include int number //队列类型 typedef struct{ int q[20] -[imported] map of the number of vertices N, Vertex map of the relationship between the starting point and end point A and B [output] if A to B without path then exporting "There is no path" Otherwise output A to B on the path vertices [storage structure] plan adopted adjacency matrix of storage. [Algorithm for the basic idea] BFS way from the vertex A, A visit followed with adjacent vertices VA1, VA2 ,..., VAK, visiting times, if not visit B, continue to visit with the VA1 adjacent vertices VA11, VA12 ,..., VA1M. VA2 and then

经典小游戏源代码 用vc++实现的 欢迎使用-small game classic source code used to achieve vc welcome to use!

用ＰＩＣ１６Ｆ５１０单片机，实现按键调光程序。按键按一下为强光，按两下为工作光，工作光电流为强光的１／２，按３下为频闪，按４下为关机。且程序设定低电压报警功能，当外部供电不足９.９Ｖ时会闪烁１０次，低于８.４Ｖ时关机

此程序是前方交会的实现，能很好的说明算法的原理，值得一看-This program is the realization of forward intersection can be a very good description of the algorithm theory, worth a visit

斗地主 斗地主 斗地主 斗地主 斗地主 -doudizhu

DSP LF2407A 板上ＤＡ例程　已跑通了-DA-board DSP LF2407A routine has been run over the

皇后问题解法任意皇后可解-Solutions arbitrary Queen"s Queen"s solvable