工业控制中的一种常用控制算法PID运算

1：FIFO和LIFO程序；2：CRC校验码算法-1: FIFO and LIFO procedure; 2: CRC verification code algorithm

将bin执行码转换为C语言代码,便分析程序执行过程-bin executable code will be converted to C language code, the implementation process analysis program

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

用锁文件实现进程通信-lock document to achieve communication proce

伯克利大学量子计算课程讲义（cs191）berkeley university quantum computing course lecture notes-berkeley university quantum computing course lecture notes

Kawaks 1.45 最终中文典藏版还是言论游戏玩游戏的好的工具，是比不可少的好-Kawaks 1.45 final version of the Chinese collection of words or play games of the good tools are essential for the good than Wanton

hehe 在这儿给大家共同分享!!! !!!! -hehe here for everyone to share!!!!!!!

任意下载——构建自己的Linux网络蚂蚁，希望对Linux/UNIX的学习者能有一定的启发

进行最小二乘法的实验处理工具-least squares method for the experimental processing tools

一个ERP源码,包括进销存/财务/生产制造等系统,已经成功应用于多家单位.- A ERP source code, including sells saves/system and so on financial/production manufacture, already succeeded applies to many units