-
jsp电子表单提交,和一些关于登陆注册的相关代码,适于初学者的功能模块...
jsp电子表单提交,和一些关于登陆注册的相关代码,适于初学者的功能模块-jsp electronic form submission, and some on the landing of the relevant register code, suitable for beginners of functional modules
- 2022-02-10 11:10:50下载
- 积分:1
-
Engineering mechanics : dynamics/R. C. Hibbeler. This book, the two matching flo...
Engineering mechanics : dynamics / R.C. Hibbeler. 此书的两张配套软盘-Engineering mechanics : dynamics/R. C. Hibbeler. This book, the two matching floppy
- 2022-01-26 01:58:16下载
- 积分:1
-
冒泡排序
#include < iostream.h > #define类int公共voidvoidvoid sortLogic() ; void bubsort:: getdata() {
cout arr [i] ; void bubsort:: showdata() {
cout
- 2022-02-07 05:45:31下载
- 积分:1
-
一个很不错的asp播放flv的源代码,欢迎下载
一个很不错的asp播放flv的源代码,欢迎下载-A very good player flv source code asp, welcome to download
- 2022-03-26 11:36:50下载
- 积分:1
-
外汇、股票交易指标源代码
在mt4平台上 将两种投资品图表显示到一起的 效果如下图 绝对原创 //+------------------------------------------------------------------+//| 星手心.mq4 |//| Chromie |//| http://www.etxcapital.cn |//+------------------------------------------------------------------+#property copyright "ETX Capital外汇平台 QQ群273546335 作者 王景阳"#property link
- 2022-02-02 12:57:41下载
- 积分:1
-
c, on heavy 2
c++, 关于重载2-c, on heavy 2
- 2022-06-14 02:10:25下载
- 积分:1
-
一个用来计算正弦波值的小程序,简单实用,不用在写C程序。...
一个用来计算正弦波值的小程序,简单实用,不用在写C程序。-Used to calculate the value of a sine wave of small procedures, simple and practical, do not have to write C program.
- 2022-03-22 10:55:39下载
- 积分: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
-
java制作播放器
java制作播放器-produced players
- 2022-02-15 07:14:22下载
- 积分:1
-
java写的简单连连看游戏,网上下载一些图片作为游戏背景
java写的简单连连看游戏,网上下载一些图片作为游戏背景-Lianliankan Writing a simple java games, download some pictures as the background of Games
- 2022-07-25 02:03:31下载
- 积分:1