-
此为文档上传的实现程序,例如上传图片的个人相册等之类的。...
此为文档上传的实现程序,例如上传图片的个人相册等之类的。-upload this file to the realization of procedures, such as uploading photos and other personal albums like.
- 2022-09-02 07:50:02下载
- 积分:1
-
二分法求大整数相乘,快速便捷。很好的源代码,可以用来学习,直接用于工程也是可以的...
二分法求大整数相乘,快速便捷。很好的源代码,可以用来学习,直接用于工程也是可以的-Dichotomy for large integer multiplication, quickly and easily. Good source code, can be used to study, can be directly used for projects of
- 2022-11-24 18:50:03下载
- 积分:1
-
OSCI组织最新lease出来的传输级建模指导实验,对初学者快速认识TLM中的一些基本概念很有用,本实验经作者修改并调试通过。...
OSCI组织最新lease出来的传输级建模指导实验,对初学者快速认识TLM中的一些基本概念很有用,本实验经作者修改并调试通过。-The tutorial1 of TLM-2.0 which is released frm OSCI group!
- 2022-07-09 03:07:25下载
- 积分:1
-
Microchip mcu drive SPI for 2.8" OLED
Microchip mcu drive SPI for 2.8" OLED
- 2023-09-03 20:30:03下载
- 积分:1
-
发运支持系统,为出货产品提供支持的一套系统
发运支持系统,为出货产品提供支持的一套系统-shipping support system 0009
- 2022-03-15 20:25:51下载
- 积分: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
-
a C language prepared by the procedures reversi war, absolutely correct, I own d...
一个用C语言编写的黑白棋对战程序,绝对的正确,我自己调试过的,能成功-a C language prepared by the procedures reversi war, absolutely correct, I own debugging off and success
- 2022-08-25 18:57:07下载
- 积分:1
-
Interval coverage of the realization of the algorithm description: In this paper...
区间覆盖问题的算法实现
问题描述:给出x轴上N条线段的坐标,从中选出一些线段来覆盖区间【0,M】,要求所用线段数目最少
-Interval coverage of the realization of the algorithm description: In this paper, x-axis N be the coordinates of line segment, selected to cover a number of line segments [interval 0, M], requirement by the number of segments at least
- 2022-12-22 05:20:03下载
- 积分:1
-
installation required, the need for the next! Thank you for your cooperation, th...
装机必备,需要的下!谢谢合作,这个是虚拟光盘的安装-installation required, the need for the next! Thank you for your cooperation, this is the installation of Virtual CD
- 2022-05-13 05:26:36下载
- 积分:1
-
based on the photographic measurement of the approximate vertical aerial photogr...
基于vc++的有关摄影测量中近似垂直摄影情况下空中后方交会求解的源代码-based on the photographic measurement of the approximate vertical aerial photography Resection Solving the source code
- 2022-07-16 01:38:43下载
- 积分:1