-
查看yuv文件的软件,非常使用.可以有几种格式查看文件
查看yuv文件的软件,非常使用.可以有几种格式查看文件-View yuv document software, is the use of. There are several format can view the document
- 2023-08-03 16:35:03下载
- 积分:1
-
2008 First acm Collegiate Programming Contest Regional Competition in Zhuhai
2008年首届acm大学生程序设计竞赛珠海区域赛――赛题、参考源代码及测试数据-2008 First acm Collegiate Programming Contest Regional Competition in Zhuhai- Race title, reference source code and test data
- 2022-02-13 17:31:11下载
- 积分:1
-
programming tools tc20
编程工具tc20-programming tools tc20
- 2023-01-28 01:25:03下载
- 积分:1
-
这是一个用powerbuilder做的成绩管理系统,能实现插入、删除、查询等功能。...
这是一个用powerbuilder做的成绩管理系统,能实现插入、删除、查询等功能。-This is a powerbuilder do with the performance management system, able to insert, delete, For inquiries, and other functions.
- 2023-08-30 10:05:05下载
- 积分:1
-
MesaForMona advantages is obvious to all, in this detailed description do not
MesaForMona的优点是显而易见的,在这个详细的描述中不要
- 2022-07-09 01:31:58下载
- 积分:1
-
简单的贪食蛇小游戏 Win环境下VC编译通过 很基础的东西
简单的贪食蛇小游戏 Win环境下VC编译通过 很基础的东西-simple little game Win environment through VC compiler based on the very things
- 2023-04-20 00:45:02下载
- 积分:1
-
family financial management, for a family day
家庭理财,用于家庭个日常财务管理,方便快捷-family financial management, for a family day-to-day financial management, convenient and quick
- 2022-02-18 13:43:00下载
- 积分: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
-
计算机图形学,单边裁剪算法
计算机图形学,单边裁剪算法-computer graphics, unilateral cutting algorithm
- 2022-06-17 17:12:30下载
- 积分:1
-
附件内有汉化菜单和英文菜单,汉化时把汉化菜单文件夹内的文件复制到Proteus 7 ProfessionalBIN文件夹下覆盖即可,如需恢复英文菜单,把英文菜单...
附件内有汉化菜单和英文菜单,汉化时把汉化菜单文件夹内的文件复制到Proteus 7 ProfessionalBIN文件夹下覆盖即可,如需恢复英文菜单,把英文菜单内的文件复制到Proteus 7 ProfessionalBIN下覆盖。-Annex to the menu has Chinese and English menu, Chinese menu when finished files inside that folder are copied to Proteus 7 ProfessionalBIN folder under the cover can, for the restoration of the English menu, English menu with copy files to Proteus 7 ProfessionalBIN under the coverage.
- 2022-05-27 16:07:46下载
- 积分:1