电力线杂波通讯资料 资料宝贵 慎重使用

简单足球是在C++ builder环境下编写的一个比较简单的小游戏-simple football is the environment in C builder prepared a simple little game

数学计算公式.多大数十种,科学计算,机器应用-mathematical formula. How dozens, scientific computing, machine application

SET Sensor SIV100B驱动调试代码-SET Sensor SIV100B driver debug code

AD9954控制C51以及产生ASK、PSK等信号-AD9954 control and C51 have ASK, PSK signals, etc.

一个用java写的手机游戏-五子棋,界面做的欠缺了点.-a written using java mobile phone games- 331 interface so the lack of points.

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

部分线性代数计算算法，个人精力有限只整理的这么一点。-Linear algebra part of the calculation algorithm, the individual efforts of so limited that only compiled.

一个关于餐观的定餐系统-a meal on the concept of fixed menu system

LPC932 80c51 header files

一个简单的贪吃蛇游戏，希望大家批评指正。-A simple game of Snake, I hope everyone criticism.