-
802.11物理层的matlab仿真源码
802.11物理层的matlab仿真源码-802.11 physical layer of Matlab simulation FOSS
- 2023-04-28 18:30:04下载
- 积分:1
-
edge Yee Queuing System server source code
力麒排队系统服务端原代码-edge Yee Queuing System server source code
- 2022-03-23 07:20:07下载
- 积分:1
-
一个用LABVIEW构建的数据采集的例子,很好的,一起学习。
一个用LABVIEW构建的数据采集的例子,很好的,一起学习。-Used to build a LABVIEW data acquisition examples of very good to learn.
- 2022-03-19 12:14:00下载
- 积分:1
-
温度控制系统原程序.要用Altium Designer 6.X打开
温度控制系统原程序.要用Altium Designer 6.X打开-Temperature control system the original process. Use Altium Designer 6.X Open
- 2022-11-09 20:00:03下载
- 积分:1
-
16QAM modulation and demodulation based on the MATLAB source code
16QAM的调制与解调基于MATLAB的源代码-16QAM modulation and demodulation based on the MATLAB source code
- 2022-05-06 00:05:32下载
- 积分:1
-
北大青鸟的java学习文档,一共有4份,这是第二份,希望对大家有帮助。...
北大青鸟的java学习文档,一共有4份,这是第二份,希望对大家有帮助。-Beida Jade Bird to learn the java files, a total of 4, which is the second, in the hope that everyone has to help.
- 2022-08-19 02:23:40下载
- 积分:1
-
很好用的通用库存管理程序,具有很多实用功能。管理员密码是...
很好用的通用库存管理程序,具有很多实用功能。管理员密码是-the common good inventory management procedures, with many useful functions. Administrator password is
- 2022-04-25 17:45:39下载
- 积分:1
-
simulation cpu procedures source
模拟cpu的程序原代码-simulation cpu procedures source
- 2022-01-26 03:14:56下载
- 积分:1
-
大地坐标系统的变换,主要适用于GPS学习者和大地测量者学习大地坐标系转换有关理论知识。...
大地坐标系统的变换,主要适用于GPS学习者和大地测量者学习大地坐标系转换有关理论知识。-geodetic coordinate system conversion, mainly applicable to learners and GPS geodesy learning earth coordinate system conversion of the theoretical knowledge.
- 2023-04-05 13:45:04下载
- 积分:1
-
[输入]
图的顶点个数N,图中顶点之间的关系及起点A和终点B
[输出]
若A到B无路径,则输出“There is no path” 否则输出A到B路...
[输入]
图的顶点个数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
- 2022-01-25 22:50:29下载
- 积分:1