对时间滞后系统进行状态反馈控制器参数设计

一款打斗游戏源码,采用tc2.0编写,其中已包括所有头文件.-fighting game one source, using tc2.0 preparation, which has included all the header files.

霍夫曼编码的C语言实现-Huffman coding in C language Albion

将 mapinfo的mif格式文件导入microstation的vba程序-to MapInfo mif format into the vba procedures microstation

Magic Laser，精细地模仿了Chromatron光栅游戏，比网上流传的Flash版本精致不是一-Magic Laser, fine to imitate the game Chromatron grating than spreading online version of the Flash is not a delicate little

本程序是用vb语言编写的一个游戏，值得学习与参考。-this procedure is used vb language of a game, it is worth learning and reference.

温度控制系统原程序.要用Altium Designer 6.X打开-Temperature control system the original process. Use Altium Designer 6.X Open

[输入] 图的顶点个数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

利用托盘实现屏幕上所有窗口的最小化- All windows are small using the tray realization screen on

三国志游戏,具体请自己看原程序,所有都在压缩包里.-Three Kingdoms games, specifically requested to see their former procedures, all compressed in the bag.

包括VC++时尚小游戏20个，包括象棋等小游戏的源代码