-
Campus-navigation-problem
校园导航问题，设计你的学校的平面图，至少包括10个以上的景点（场所），每两个景点间可以有不同的路，且路长也可能不同，找出从任意景点到达另一景点的最佳路径（最短路径）。
要求：
（1）以图中顶点表示校园内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等有关信息。
（2）为来访客人提供图中任意景点相关信息的查询。
（3）为来访客人提供任意景点的问路查询，即查询任意两个景点之间的一条最短路径。
（4）修改景点信息。
(Campus navigation problem, the design of your school s plan, at least more than 10 attractions (places), between every two spots can have a different way, and the long road may be different, to find spots to reach from any other attractions best path (shortest path).
Requirements:
(1) graph vertices represent various campus sites, storage sites name, code, profile and other information the side that path, the path length of storage of information.
(2) the figure for visiting any sites offering information about the query.
(3) any attractions for visiting guests ask queries of that query any two of the shortest path between sites.
(4) modify the attractions information.)
- 2011-08-12 10:34:14下载
- 积分：1
-
哈夫曼树的c++实现
实验说明
实验所用英文文本为 /HaffmanfT 下的a.txt文件，原文为：
South Korea’s top court ruled on Thursday that Japan’s Mitsubishi Heavy Industries Ltd must compensate 28 South Koreans for their forced labor during World War Two, a ruling that drew an immediate rebuke from Tokyo.
The decision echoed the Supreme Court’s landmark verdict last month that ruled in favor of South Koreans seeking compensation from Japan’s Nippon Steel & Sumitomo Metal Corp. for their wartime forced labor.
The court upheld a 2013 appeals court decision that Mitsubishi must pay 80 million won ($71,000) to each of the 23 plaintiffs in compensation.
In a separate
- 2023-04-18 18:05:04下载
- 积分：1
-
NewCode
清（英文）常见数据结构，代码实现，值得下载，值得分享(Qing (English) common data structure, code implementation, worth downloading, worth sharing)
- 2012-11-21 14:33:49下载
- 积分：1
-
a
说明： 用数据结构实现 螺旋数组 他分为东西南北4个方向 进行检测(Data structure used to achieve his spiral array is divided into four north-south east-west direction detection)
- 2008-12-22 14:47:31下载
- 积分：1
-
tree
C语言树的简单实现,介绍了树你前序遍历，树插入与删除节点的实现(C-tree is simple to achieve, before you introduced the tree traversal, tree insert and delete nodes to achieve)
- 2011-01-11 22:19:07下载
- 积分：1
-
Bigint
利用双向链表实现对两大整数的相加运算。
可以修改数组长度实现更大整数的相加(Realize the use of two-way linked list of integers the sum of the two operations. Can modify the array length to achieve a greater sum of integers)
- 2007-10-18 21:34:06下载
- 积分：1
-
lab07
本例主要设计查找的有关算法，例如有序表的查找和顺序标的查找，顺序查找、折半查找及二叉排序树上查找的基本思想和算法实现等。(In this case mainly designed to find the relevant algorithm, such as an ordered list of the find and order the subject to find, sequential search, binary search and binary sort tree to find the basic idea and algorithm.)
- 2013-05-12 22:01:58下载
- 积分：1
-
MiniSpanTree
说明： 建立图并求解图的最小二叉树并且输出结果，基础的最小二叉树算法(MiniSpanTree algorithm)
- 2019-01-03 18:46:10下载
- 积分：1
-
Lksource
数据结构的链表使用(data structure using the Chain)
- 2005-01-02 19:59:54下载
- 积分：1
-
lianbiao
用c语言写的线性链表的创建、删除、插入、销毁代码(With c language to create a linear linked list, delete, insert, destroy code)
- 2011-10-13 23:06:55下载
- 积分：1
