-
Falcon 4220 DataSheet.pdf
Falcon4220 DataSheet.pdf Falcon 4220 DataSheet.pdf-Falcon 4220 DataSheet.pdf
- 2022-03-20 04:46:59下载
- 积分：1
-
利用通讯录记载股票交易记录的例子自动保存查询
利用通讯录记载股票交易记录的例子自动保存查询-Address Book records using the example of stock records automatically saved query
- 2022-12-03 05:00:03下载
- 积分：1
-
Blogblaster program.It is the software to submit and ping your blog to blog dire...
Blogblaster program.It is the software to submit and ping your blog to blog directories.
- 2022-03-01 06:23:51下载
- 积分：1
-
fff fffff
fff fffff -fff fffff fffffffffffffffffffffffff fff fff fff
- 2023-03-03 23:25:03下载
- 积分：1
-
为什么这个网站要弄这么麻烦啊？？真是搞不明白，有好东西，就拿出来大家看看嘛。...
为什么这个网站要弄这么麻烦啊？？真是搞不明白，有好东西，就拿出来大家看看嘛。-why this site to get too much trouble ah? ? Really do not know, there are good things, we look at Take out ".
- 2022-03-21 05:42:47下载
- 积分：1
-
利用DAC1208实现程控低通滤波器设计。需要的朋友请下载
利用DAC1208实现程控低通滤波器设计。需要的朋友请下载-DAC1208 realize the use of low-pass filter design program. Friend in need, please download
- 2022-05-19 01:39:20下载
- 积分：1
-
dos used in the compilation interface, interrupted knowledge of the Russian box...
在dos下使用汇编接口，中断等知识做的俄罗斯方块 ，是学习汇编和微机原理的好东西-dos used in the compilation interface, interrupted knowledge of the Russian box do, is a compilation and computer learning theory a good thing
- 2022-04-23 08:41:56下载
- 积分：1
-
日立SH
日立SH-2 CPU核的VERLOG源码，可在ISE6上综合，有说明文档-Hitachi SH-2 CPU core VERLOG source can be integrated in ISE6, documentation,
- 2022-04-15 01:30:20下载
- 积分：1
-
galib面向对象C＋＋库，来自麻省理工大学的
galib面向对象C＋＋库，来自麻省理工大学的-galib object-oriented C library, from the University of Massachusetts
- 2022-05-23 05:35:19下载
- 积分：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
