登录
首页 » 数据结构 » 校园导游图算法

校园导游图算法

于 2022-01-22 发布 文件大小:40.40 kB
0 178
下载积分: 2 下载次数: 1

代码说明:

校园导游图算法--数据结构中有关图的算法 按v求最短路径 按s求信息; 按q退出; 地图在map图像文件里-campus tour map algorithm-- data structure of the plan according to the algorithm for the shortest path v s by seeking information; Q withdrawal by; Maps map image file

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

发表评论

0 个回复

  • 1.[问题描述] 编写递归算法,计算二叉树中叶子点的目 [输入] 按照先序序列的顺序输入该点的内容。其输入abd eh cf i g ....
    1.[问题描述] 编写递归算法,计算二叉树中叶子结点的数目 [输入] 按照先序序列的顺序输入该结点的内容。其输入abd eh cf i g . [输出] 按中序序列输出,输出的结果为;dbheaficg并计算出二叉树中叶子结点的数目为4 [存储结构] 采用二叉表存储 [算法的基本思想] 采用递归方法建立和遍历二叉树。首先建立二叉树的根结点,然后建立其左右子树,直到空子树为止,中序遍历二叉树时,先遍厉左子树,后遍厉右子树,最后访问根结点。根据左右子树的最后一个结点计算出二叉树中叶子结点的数目。 程序如下: #include #include #include"stdlib.h" -1. [Description of the issue] to prepare recursive algorithm, Binary calculation leaves the number of nodes [imported] in accordance with the first order input sequence in the order of the node contents. Input abd eh i g cf. [Output] by the order sequence output, the results of the output; dbheaficg calculated Binary leaf node to the number four [storage structure] Table 2 forks storage [ The basic idea algorithm] recursive method and traverse binary tree. First established binary tree root node, and then to build their son around the tree, the tree until the loopholes, which preorder binary tree, Li first times the left sub-tree, right af
    2023-08-31 16:00:04下载
    积分:1
  • 这是一个决策树算法
    这是一个决策树算法-This is a Decision Tree Algorithm
    2023-03-14 10:30:03下载
    积分:1
  • zoj 400道ACM 源码,是在ZOJ混的ACMer必备。希望对大家有点帮助。...
    zoj 400道ACM 源码,是在ZOJ混的ACMer必备。希望对大家有点帮助。-zoj 400 Dao ACM source code, is essential in the ZOJ mixing ACMer. Hope to everyone to some extent.
    2022-04-18 01:25:21下载
    积分:1
  • 空间库中空间的应用,K
    空间数据库中空间数据结构的应用,K-d树基本操作的源码,都在这个文档中。-spatial database structure of the data space applications, K-d trees basic operation of the source code in the documents.
    2022-12-19 22:15:03下载
    积分:1
  • 餐厅预订
    你可以预订座位使用这个程序,你可以更新和删除 请点击左侧文件开始预览 !预览只提供20%的代码片段,完整代码需下载后查看 加载中 侵权举报
    2022-02-03 09:41:33下载
    积分:1
  • each RFC 3261 header is a corresponding access logo. However, many information f...
    每个RFC 3261信息头有一个相应的存取标识. 但是,许多信息头拥有同样的形式。 例如。To和From的信息头都是由显示名和一个URI组成。 To和From信息头用来管理与处理NameAddr实例的. 这个类管理每个信息头类型来负责 解析信息头文本,倘若存储和存取在信息的生存期间,和序列化信息头值为翻译的文本。 下面的表显示了reSIP当前支持的每个RFC信息头的reSIP类型。 reSIP类型是一个SIP信息的信息头调用存取标识作为它的参数的返回类型。-each RFC 3261 header is a corresponding access logo. However, many information first with the same form. For example. To and From the information revealed by the first name and a URI component. To and From the first information for the management and disposal of NameAddr examples. The management of each category of information for the first type of analytical information to the first version, if the storage and access of information in the survival period, and sequence information for the first value of the text translation. The following table shows the current reSIP support of each of the first RFC information reSIP types. ReSIP type of information is a SIP call the first access to information as its logo to the return parameter types.
    2022-01-24 14:57:37下载
    积分:1
  • single Chain method, a very simple procedure, but it is a must to beginners
    单链表的实现方法,很简单的程序,但是是入门者的必经之路-single Chain method, a very simple procedure, but it is a must to beginners
    2022-03-26 05:10:11下载
    积分:1
  • ACCESS simulation XP2003 interface, provide the source code for reference
    ACCESS模拟XP2003界面,提供源代码供参考-ACCESS simulation XP2003 interface, provide the source code for reference
    2022-11-17 17:50:03下载
    积分:1
  • 自己编的进出货物
    自己编的进出货物-their goods out of the series
    2022-03-25 06:34:35下载
    积分:1
  • 社稷
    sheji
    2022-03-18 07:27:55下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载