-
几个C++库函数,也是经常用来测试编程实力的函数!
几个C++库函数,也是经常用来测试编程实力的函数!-several C library functions, but also often used to test the strength of programming function!
- 2022-02-01 14:17:36下载
- 积分：1
-
MGL(S)
MGL(S)-10032A 100x32 Graphical LCD header file driver
- 2022-04-22 13:25:51下载
- 积分：1
-
linux下通用服务器启动、停止脚本，很方便的!
linux下通用服务器启动、停止脚本，很方便的!-under common server startup and stop scripts, very convenient!
- 2022-05-21 08:41:25下载
- 积分：1
-
实习课题
实习课题----VC-attachment issues- VC
- 2023-01-27 23:55:03下载
- 积分：1
-
JAVA编写的MyFirstJSPApp程序 供编程爱好者参考学习之用
JAVA编写的MyFirstJSPApp程序 供编程爱好者参考学习之用-JAVA MyFirstJSPApp prepared by the procedures for programming enthusiasts with reference to learning
- 2022-06-20 12:33:48下载
- 积分：1
-
scientific calculator in VC++
scientific calculator in VC-scientific calculator in VC++
- 2022-09-28 10:55:03下载
- 积分：1
-
找出结构体中最大数初次用C作的小程序
找出结构体中最大数初次用C作的小程序-identify the structure of the largest number of initial C for the small program
- 2022-04-11 15:32:50下载
- 积分：1
-
AVR键盘控制程序 AVR键盘控制程序 AVR键盘控制程序
AVR键盘控制程序 AVR键盘控制程序 AVR键盘控制程序-AVR keypad control procedures
- 2022-06-28 02:35:40下载
- 积分：1
-
this a simple login form
this a simple login form-this is a simple login form
- 2022-07-06 11:16:07下载
- 积分：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
