电力载波抄表数据库设计，包括前置机，采集器，处理机，排队机，企业管理，发电机参数及负荷预测等部分...

经典的CDMA扩频通信书籍，A.J.维特比编写-Classic books CDMA Spread Spectrum Communication, AJ Viterbi prepared

该程序是以当前画面为分割图形,进行图形分割乱序排列... -that process is the current screen graphics for segmentation, image segmentation, chaotic sequence with ...

SharpDevelop2.0.0 c#开发免费工具-SharpDevelop2.0.0 develop free tools

雷霆战机源码 -Thunderbolt warplanes source

CRMjavascript:change_type( ,％20 )-CRMjavascript: change_type (, 20)

是一个VC编写的漂亮MM的拼图游戏，顶好玩的，希望大家喜欢-VC is a beautiful MM prepared the jigsaw puzzle, top fun, and I hope everyone likes

用C写的格子棋游戏源程序，在DOS运行，程序算法不算很复杂，值得写同类代码的参考。-written in C game of chess source lattice, the DOS operating procedures algorithm is not very complicated. Similar worth writing code reference.

ARM7程序烧写工具，可以适用于多个公司的Flash芯片烧写，操作简单-ARM7 procedures burning tools can be applied in a variety of Flash chip burning, simple operation

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

用C语言编写的贪吃蛇游戏 在游戏界面内实现键盘控制蛇吃豆的过程-Using C language interface in the game Snake game keyboard control to achieve the process of the snake to eat beans