-
小巧又很好用的串口调试工具,比其他普通常用的功能强大的多。...
小巧又很好用的串口调试工具,比其他普通常用的功能强大的多。-Also good used compact serial debugging tools, than other commonly used general and more powerful.
- 2022-05-28 18:30:29下载
- 积分:1
-
can modify the designated domain name information. Many single
可以修改指定的域名信息 .单空间多域名绑定管理程序-can modify the designated domain name information. Many single-space domain name bundled management procedures
- 2022-01-26 02:44:09下载
- 积分:1
-
a classic example of C language learning how to use pay you some passwords
一个经典的C语言学习例子 交你如何使用一些口令-a classic example of C language learning how to use pay you some passwords
- 2022-05-20 08:22:05下载
- 积分:1
-
C语言语法,详细讲解了volatile_unsigned_ long的使用
C语言语法,详细讲解了volatile_unsigned_ long的使用-C language syntax, explained in detail the use of volatile_unsigned_ long
- 2023-02-06 12:25:03下载
- 积分:1
-
这个是有关于随即信号的文章,里面具体介绍了这个信号的概念,应用等...
这个是有关于随即信号的文章,里面具体介绍了这个信号的概念,应用等-this is a signal immediately on the articles, which introduced the specific signal to the concept and application
- 2022-01-31 13:42:14下载
- 积分:1
-
GMSK 调制方式 通信专业学生通用 功能很强大
GMSK 调制方式 通信专业学生通用 功能很强大 -GMSK modulation communications professional students are a powerful general-purpose functionality
- 2022-06-21 18:19:31下载
- 积分:1
-
一个非常好的微处理器检测遥控器编码的C++
原代码项目文件,直接可用,LED显示...
一个非常好的微处理器检测遥控器编码的C++
原代码项目文件,直接可用,LED显示-a very good microprocessor remote detection coding in C source code, project documentation, direct can be used, LED Display
- 2022-03-05 14:00:53下载
- 积分:1
-
Student achievement management system, can be used for reference!
学生成绩管理系统,C++做的,可作参考!-Student achievement management system, can be used for reference!
- 2022-06-22 00:44:07下载
- 积分:1
-
一个彩票统计源代码
一个彩票统计源代码--Code about lottery tickets statistics
- 2022-10-21 09:15: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