ALOHA

模拟电子技术助学网上的大量学习资料，整理之后做的一本电子书便于离线学习(Analog Electronic Technology student a lot of online learning materials, after finishing an eBook easy to do offline learning)

Predicting cell concentration value using Neural networks

说明：  陀螺仪读取数值角度（需在myRIO项目中使用）(Gyroscope reading value angle (to be used in myrio project))

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

Univ. of Calgary CREWS的免费地震研究软件-Univ. Of Calgary CREWS seismic studies of the free software

说明：  matlab 计算bessel光束，零阶贝塞尔函数，希望对大家有所帮助(matlab calculates the Bessel beam)

stm32读SD卡内的数据,并将其显示到TFT屏幕上(stm32 read SD card data and displays it to the TFT screen)

C# GDI+绘图实例源码，演示如何实现基本的GDI+绘图操作以及处理窗体显示事件，内含两个GDIDrawing绘图例子，可画直线、简单的几何图形等，如示例截图所示，比较基础的GDI+绘图实例。

说明：  How to use python to make games

it is described the management processes, roles, behavior and skills