登录
首页 » Windows开发 » 很好的代码请使用

很好的代码请使用

于 2022-01-28 发布 文件大小:413.57 kB
0 169
下载积分: 2 下载次数: 1

代码说明:

很好的代码请使用-good use of the codes, please

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • haptic六自由度主控臂的粘性摩擦效果
    haptic六自由度主控臂的粘性摩擦效果-6-DOF haptic arm dominated the viscous friction effect
    2022-03-13 20:29:45下载
    积分:1
  • 程控交换机话单获取
    程控交换机话单获取-program- controlled switches so single access
    2022-01-30 16:31:58下载
    积分:1
  • 双线性插值
    Bilinear Interpolation
    2022-03-04 02:45:27下载
    积分:1
  • 隐藏任务栏的实例代码,用VB编写,加入到你的程序中,十分实用...
    隐藏任务栏的实例代码,用VB编写,加入到你的程序中,十分实用-hide the task bar code examples, VB prepared to join your program, a very practical
    2023-02-17 01:25:04下载
    积分:1
  • 很好的程序
    很好的程序-Very good procedures
    2022-03-22 17:12:36下载
    积分:1
  • sudoku calculator
    数独求解题: 该程序, 初始条件可用键盘直接在界面上输入, 求解结果显示在界面上。 很好玩的-sudoku calculator
    2023-08-09 23:20:02下载
    积分:1
  • 我注意到有一段时间,在Windows XP中,当你使用浏览器删除..
    I ve noticed for a while that on Windows XP, when you use Explorer to delete a file or directory that is in use by another process, it takes what seems like an eternity before an error message appears telling you the file can t be deleted. During this time, there is no indication that Explorer even noticed the delete command. No hourglass, no nothing. By the time the message box appears, I ve already hit the delete key a few more times in a futile attempt to get Explorer to just do something, already. Either delete the file or tell me you can t...throw me a bone here.
    2022-01-31 01:32:56下载
    积分:1
  • This code find object in map you need
    This code find object in map you need
    2022-03-07 07:29:05下载
    积分:1
  • 很好用的 电梯程序。
    很好用的 电梯程序。-good use of the lift procedures.
    2022-07-01 21:51:56下载
    积分:1
  • Description: 采用邻接表表示有向图,完成图的创建、图的深度优先遍历、图的广度优先遍历操作。其中图的顶点信息是字符型,图中顶点序号按字符顺序排列,...
    Description: 采用邻接表表示有向图,完成图的创建、图的深度优先遍历、图的广度优先遍历操作。其中图的顶点信息是字符型,图中顶点序号按字符顺序排列,边的输入按照边的顶点序号从小到大的顺序排列,如下图的边的输入顺序为0 1,0 2,0 3,1 2,1 3,2 4,3 4共七条边,邻接表的边结点采用头插法。本输入样例中所用的图如下所示: Input Format: 第一行输入两个值,第一个是图中顶点的个数,第二个是图中边的条数 第二行输入各顶点的信息,即输入每个顶点字符 第三行开始输入每条边,每条边的形式为两个顶点的序号,中间以空格隔开,输入完一条边换行 Output format: 首先输出图的顶点信息,输出完毕换行 接着输出图的邻接表,格式为首先输出第一个顶点,接着输出该顶点的所有的临界点的序号,换行,然后输出下一个顶点及邻接点,以此类推 接下来一行输出从图的第一个顶点开始进行深度优先遍历的序列,中间以空格隔开,输出完毕换行 最后一行输出从图的第一个顶点开始进行广度优先遍历的序列,中间以空格隔开,输出完毕换行 -Description: Adjacency list using said directed graph to complete the map creation, map of the depth-first traversal, breadth-first graph traversal operations. In which vertex information is character, the graph vertices in order arranged by character number, while the input side of the vertex according to serial number from small to large order, the following graph of the input side of the order of 0 1,0 2,0 3,1 2,1 3,2 4,3 4 a total of seven edge, the edge-node adjacency list using the first interp
    2022-01-28 23:09:39下载
    积分:1
  • 696518资源总数
  • 106235会员总数
  • 12今日下载