-
aspnet学习相关的一些例子
aspnet学习相关的一些例子-ASPNET study relevant examples
- 2022-03-30 04:22:05下载
- 积分:1
-
calculator, a simple calculation functions, vc programming reflects the benefits...
计算器,实现简单的计算功能,体现vc编程的好处!-calculator, a simple calculation functions, vc programming reflects the benefits!
- 2022-07-04 15:45:25下载
- 积分:1
-
HLSL_shadow是一个HLSL的shadowmap源码
HLSL_shadow是一个HLSL的shadowmap源码-HLSL_shadow is a HLSL source of shadowmap
- 2023-06-28 18:35:04下载
- 积分:1
-
嵌入式WINCE画2D图形程序,用EVC开发实现的
嵌入式WINCE画2D图形程序,用EVC开发实现的-Embedded WINCE painted 2D graphics program, the development achieved by EVC
- 2022-02-05 02:19:02下载
- 积分:1
-
线程与进程的一个实例
线程与进程的一个实例-threads and processes an example
- 2022-03-12 12:14:15下载
- 积分:1
-
如何让屏幕保护立即运行
如何让屏幕保护立即运行-how to screen immediately run
- 2022-08-23 09:28:44下载
- 积分:1
-
听说过‘三子棋’游戏吗?该程序是单机版的‘三子棋’游戏。规则很简单:下子阶段,组成’三‘时,可把对方的子变为无效子(下完后该子会被去掉)。行棋阶段,组成“三”时...
听说过‘三子棋’游戏吗?该程序是单机版的‘三子棋’游戏。规则很简单:下子阶段,组成’三‘时,可把对方的子变为无效子(下完后该子会被去掉)。行棋阶段,组成“三”时,可把对方的子直接去掉。谁最先无子谁就输-heard "three-game" game? The program is stand-alone version of the "three-game" game. Very simple rules : Now phase, composed of "three", the other side can void the son son (after the son will be removed). OK chess stage and formed a "3", the other side can direct the children removed. Who is the first one without a son who will lose
- 2022-10-23 14:00:03下载
- 积分:1
-
简单的汉诺塔程序 用于的动态显示 排列过程
简单的汉诺塔程序 用于的动态显示 排列过程-Simple Tower of Hanoi program arranged for the dynamic display during
- 2022-04-09 16:10:22下载
- 积分:1
-
采用邻接矩阵表示无向图,完成图的创建、图的深度优先遍历、图的广度优先遍历操作。其中图的顶点信息是字符型,图中顶点序号按字符顺序排列。本输入样例中所用的图如下所示...
采用邻接矩阵表示无向图,完成图的创建、图的深度优先遍历、图的广度优先遍历操作。其中图的顶点信息是字符型,图中顶点序号按字符顺序排列。本输入样例中所用的图如下所示:
Input Format:
第一行输入两个值,第一个是图中顶点的个数,第二个是图中边的条数
第二行输入各顶点的信息,即输入每个顶点字符
第三行开始输入每条边,每条边的形式为两个顶点的序号,中间以空格隔开,输入完一条边换行
Output format:
首先输出图的顶点信息,输出完毕换行
接着输出图的邻接矩阵,假如图中有n个顶点,则输出形式为n行n列的邻接矩阵,输出完毕换行
接下来一行输出从图的第一个顶点开始进行深度优先遍历的序列,中间以空格隔开,输出完毕换行
最后一行输出从图的第一个顶点开始进行广度优先遍历的序列,中间以空格隔开,输出完毕换行
-Using an undirected graph adjacency matrix representation to complete the map creation, graph depth-first traversal, graph breadth-first traversal operation. In which vertex information is character, the graph vertex number by characters in order. The input sample used in the diagram are as follows:
Input Format:
The first line of input two values, the first one is the number of graph vertices, the second one is the number of graph edges
Second row, enter information in each vertex, that enter each vertex character
Start typing in the third line of each side, each side in the form of two vertices
- 2022-01-26 03:32:41下载
- 积分:1
-
jsp简单电商网站设计
实现功能登陆、注册、个人中心、购物车增删改、动态商品页面
- 2022-02-02 01:57:50下载
- 积分:1