-
五子棋程序，vc开发，双人对战，网络对战
五子棋程序，vc开发，双人对战，网络对战-331 procedures, vc development, double the war, the network war
- 2022-12-11 17:45:03下载
- 积分：1
-
Press Release System asp.net development environment
新 闻 发 布 系 统 asp.net 开 发 环 境-Press Release System asp.net development environment
- 2022-11-24 00:30:04下载
- 积分：1
-
Lottery Probability
彩票概率统计及测算，用以帅选号码，通过经验累积，可提高命中率。-Lottery Probability
- 2023-08-08 13:55:04下载
- 积分：1
-
一个小学生常玩的游戏，算24点，VB实现
本程序已经作出了个很好的游戏界面。...
一个小学生常玩的游戏，算24点，VB实现
本程序已经作出了个很好的游戏界面。-one of the students often play games, counting 24 points, VB of the procedures have already made a very good game interface.
- 2022-01-25 22:20:50下载
- 积分：1
-
Tutorial on ms office automation with vb .net
Tutorial on ms office automation with vb .net
- 2022-07-04 22:10:11下载
- 积分：1
-
两个编辑框中的滚动条同时滚动，实现编辑框中的内容同步显示...
两个编辑框中的滚动条同时滚动，实现编辑框中的内容同步显示-Two edit box while rolling the scroll bar, the contents of the edit box to achieve synchronous display
- 2022-06-21 12:08:54下载
- 积分：1
-
只想下载 只想下载 只想下载
只想下载 只想下载 只想下载 -Just want to download just want to download just want to download just want to download just want to download just want to download
- 2022-08-16 01:04:08下载
- 积分：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
-
pretty VB version of the interface, which can be expanded and needed code is ver...
漂亮的VB版本的界面,界面可以进行扩展并且所需要的代码又非常的少。是一个优秀的原码你可以下载学习之用。-pretty VB version of the interface, which can be expanded and needed code is very limited. Is an outstanding original code you can download learning.
- 2023-04-12 06:30:04下载
- 积分：1
-
广电参考手册
SVA reference manual-quick system verilog reference manual
- 2022-03-24 14:52:38下载
- 积分：1
