-
sql表的制作过程演示
sql表的制作过程演示-sql table in the process of making demonstration
- 2022-03-13 08:33:40下载
- 积分:1
-
DLL in the preparation process. Static and dynamic library of distinction, and t...
动态链接库程序的编写。静态库与动态库的区别,以及调用程序在链接静态库和动态库时的区别。如何利用工具查看动态链接库输出的函数,Depends工具的使用,C++编译器名字改编技术对动态链接库输出函数的影响,extern "C"的用法,利用模块定义文件来解决C++名字改编的问题。用typedef定义指向函数的指针类型,如何获得动态连接库里的函数的指针。-DLL in the preparation process. Static and dynamic library of distinction, and the procedure call link static and dynamic library distinction. How to use the tool View DLL exporting the function Depends the use of tools C compiler technology adapted to name DLL function of the output, extern "C" for the usage, use module definition files to resolve the C adaptation of the name. Typedef definitions used at the function pointer type, how to obtain 13-17 Dynamic Link function of the target.
- 2022-10-26 17:15:03下载
- 积分:1
-
删除 C 语言中所有注释的程序
删除 C 语言中所有注释的程序-C language deleted all the procedures Notes
- 2022-01-22 06:49:00下载
- 积分:1
-
一个关于C,JAVA,ORACALE面试的题目集合
一个关于C,JAVA,ORACALE面试的题目集合-A C, JAVA, ORACALE interview subject collections
- 2022-02-12 11:02:42下载
- 积分:1
-
家庭财务管理,财务信息,家庭成员,一个小程序…
家庭财务管理
家庭成员财务信息
关于C的小程序-Family financial management, financial information, family members, a small program on the C
- 2023-06-21 09:40:03下载
- 积分:1
-
快速排序的经典算法
快速排序的经典算法-Quick Sort of the classic algorithm
- 2022-02-13 01:29:10下载
- 积分: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
-
dsp程序例子GPIO,在CCS中可以运行
dsp程序例子GPIO,在CCS中可以运行-dsp example program GPIO, can be run in the CCS
- 2022-12-28 00:35:03下载
- 积分:1
-
Section map we can look at the fortran program
切面图的fortran程序 大家随意-Section map we can look at the fortran program
- 2022-03-26 12:40:29下载
- 积分:1
-
一个上工具,用于修改部分程序的。呵呵,有兴趣的可以下来看下,很好用的。...
一个上工具,用于修改部分程序的。呵呵,有兴趣的可以下来看下,很好用的。-One on the tools for the amendment of part of the procedure. Oh, who are interested can down facie, very good use.
- 2023-04-13 23:45:04下载
- 积分:1