-
有向图的邻接表存储的实现graph
有向图的邻接表存储的实现，包括有向图的各种操作(Directed graph adjacency list storage implementation, including a variety of operations to the map)
- 2020-07-16 10:38:50下载
- 积分：1
-
work1
讲解了循环单链表的建立，以及在链表中插入、删除、更改数据...(Explain the establishment of circular single linked list, and insert in the list, delete, change the data ...)
- 2010-10-03 11:00:45下载
- 积分：1
-
liu
一．问题描述
对2006年度全国80多个城市的每天空气质量状况进行查询、排序等操作。
空气质量状况对象包括城市代码、城市名称、首要污染物、污染指数、污染物级别、空气状况、年、月、日
二、实验要求
1． 普通查询：输入城市名称和城市代码，分别查询该城市每天、每周、每月、每季度和全年的空气质量状况
例子：查询太原市2006年第8周的空气质量状况
2．统计查询：
（1）输入城市名称和城市代码，分别查询该城市每周、每月、每季度和全年的空气质量为优、良、轻微污染、轻度污染、重污染的天数
例子：查询石家庄市2006年第2季度空气质量为轻微污染的总天数
（2）根据时间查询空气质量状况：输入周编号、月编号、季度编号或年编号，以及空气质量为优、良、轻微污染、轻度污染、重污染的天数，查找相应的城市名称
例子：查询2006年5月，空气被轻度污染3天以上的城市有哪些？
3．排序查询
（1）输入周编号、月编号、季度编号或年编号，查询城市空气质量的排行榜
例子：查询2006年第6周，全国空气平均质量最好的前20个城市为哪些？
三、数据文件
Data.txt(one. Problem Description of the air quality day in 2006 more than 80 cities nationwide query, sorting and other operations. Air Quality objects include city code, city name, the primary pollutant, pollution index, contaminant level, air condition, year, month, day two, experimental requirements 1. General Queries: Enter a city name and city codes, each query in the city daily, weekly, monthly, quarterly example air quality and full year: Queries air quality in Taiyuan first eight weeks of 2006 2. Statistical inquiry: (1) enter a city name and city codes, each query in the city weekly, monthly, quarterly and annual air quality as excellent, good, slight pollution, light pollution, heavy pollution days example: inquiry Shijiazhuang City in 2006 second quarter, the air quality is the total number of days a slight pollution (2) according to time of the query air quality conditions: enter the week number, month number, quarter number or in number, and the air quality is excellent, good, sli)
- 2017-04-07 10:58:37下载
- 积分：1
-
Data-structure-diagram
数据结构中图的存储结构的建立与搜索
建立图的二种存储结构
在不同的结构上实现遍历
(Data structure diagram of the storage structure of the establishment of the search to establish two kinds of graph storage structure in the different structures to achieve through)
- 2011-06-27 09:29:40下载
- 积分：1
-
Test6
最短路径算法。
用无向带全图的邻接矩阵存储图，确定从源点出发到其它各点的最短路径。
输入：图中包含的顶点数n 边数m， 各边权值，用邻接矩阵或者邻接表存储。
输出：源点到其它各点的最短路径值。(Shortest path algorithm. Adjacency matrix storage with undirected graph with a full figure, determine the starting point of the shortest path from the source point of each other. Input: Vertices figure included n the number of edges m, the weight of each side, with the adjacency matrix or adjacency table storage. Output: source shortest path to value each other points.)
- 2014-05-11 17:05:37下载
- 积分：1
-
插入排序
说明： 根据所选定的字符顺序，按照从大到小的规则，对字符进行插入排序，(Insert and sort characters)
- 2020-06-22 12:40:01下载
- 积分：1
-
bfs
这是BFS算法的实现。用C语言实现的。好好学习吧。(This is achieved BFS algorithm. Implemented using C language. Learn it.)
- 2013-12-05 15:56:50下载
- 积分：1
-
add-sub
实现了多项式的创建，实现了多项式的加减乘除等基本操作(The realization of polynomial create, to achieve the polynomial add, subtract, multiply and divide the basic operation)
- 2011-08-15 17:34:46下载
- 积分：1
-
search
数据结构与算法分析的 C++检索代码，很经典(the code of Data structure)
- 2016-12-22 13:30:46下载
- 积分：1
-
FreeTree
无环连通图G=(V, E)亦称为自由树T，其直径是树中所有顶点之间最短路径的最大值，设计一个算法求T的直径(Acyclic connected graph G = (V, E) is also known as free tree T, whose diameter is the tree of shortest paths between all vertices maximum design an algorithm for the diameter of T)
- 2013-10-29 16:31:47下载
- 积分：1
