1、拓扑排序的算法有2种：1种是删边法，另一种是采用DFS深度优先搜索的方法。 本题给出一组有向图，请采用一种拓扑排序方法判断该图是否有环。
2、 现给定一个AOE网，有向边（弧）表示活动，弧上权值表示活动完成需要的时间。请你编写程序，回答上述三个问题。
1. Please use a topological sorting method to determine whether the graph has rings or not.
2. Given an AOE network, the directed edge (arc) represents the activity, and the weight on the arc represents the time required for the activity to complete. Please write a program to answer these three questions. (2018-12-29, C/C++, 2KB, 下载0次)
1.图书展示(图书分类、图书详情、各种排行榜)
2.图书搜索(基本搜索、高级搜索、搜索结果多种排序、进一步缩小搜索范围)
3.图书推荐(将图书推荐给好友)
4.图书收藏(暂时不购买的图书可以收藏)
5.图书购买(完善的购买流程、使用云网在线支付网关，收费率低，结算周期短)
1. Books show (book catalog, book details, a variety of charts)
2. Book Search (Basic Search, Advanced Search, a variety of search results sorted further refine search)
3. Recommended Books (Books will recommend to a friend)
4. Book Collection (purchased books can temporarily favorites)
5. Books purchase (complete purchase process, using the cloud network online payment gateway, low charges, billing cycle is short) (2016-04-17, ASP, 1949KB, 下载2次)
网易云课堂-陈越、何钦铭-数据结构-2016春
PTA-06-图2 Saving James Bond - Easy Version
编译器-python2
This time let us consider the situation in the movie Live and Let Die in which James Bond, the world s most famous spy, was captured by a group of drug dealers. He was sent to a small piece of land at the center of a lake filled with crocodiles. There he performed the most daring action to escape he jumped onto the head of the nearest crocodile! Before the animal realized what was happening, James jumped again onto the next big head... Finally he reached the bank before the last crocodile could bite him (actually the stunt man was caught by the big mouth and barely escaped with his extra thick boot). (2016-04-12, Python, 1KB, 下载1次)
网易云课堂-陈越、何钦铭-数据结构-2016春
PTA-06-图1 列出连通集
给定一个有NNN个顶点和EEE条边的无向图，请用DFS和BFS分别列出其所有的连通集。假设顶点从0到N− 1N-1N− 1编号。进行搜索时，假设我们总是从编号最小的顶点出发，按编号递增的顺序访问邻接点。
编译器：python2
Given a free E N vertices and edges of the graph, please list the set of all of its communication with the DFS and BFS. Assume that the vertices 0 to N-1N-1N-1 number. When you search, we always assume the smallest number of vertices in ascending numerical order adjacent access points. (2016-04-12, Python, 1KB, 下载4次)
主要是利用加权有向图对城市交通网进行建模，通过求解交通导航问题，熟悉图结构的储存、表示和操作，同时加深理解加权有向图的连通性判断和全源最短路径算法。
Mainly using a weighted directed graph modeling for urban traffic network by solving traffic navigation problems, get familiar store showing the structure of representation and operations, while deepening understanding weighted to determine the connectivity of graphs and full source shortest path algorithm. (2015-05-05, Visual C++, 2KB, 下载10次)
1.采用链式结构实现任意多项式的存储，求两个多项式的和。
2.假设自上而下按层次，自左至右输入每个结点的一个三元组(D, P, L/R)。其中D为本结点的元素，P为其父结点，L指示D为P 的左孩子，R指示D为P的右孩子。试写一个建立二叉树在内存的双链表示算法，并实现先根、中根、后根以及层序遍历算法。
3.采用邻接矩阵实现有向网的存储，建立有向网，并实现单源最短路径算法。
1 using an arbitrary polynomial chain structure of storage, and the sum of two polynomials. 2 Assuming a hierarchical top-down, from left to right input of each node a triple (D, P, L/R). Where D is an element node, P is the parent node, L indicates D is the left child of P, R indicates D is P' s right child. Try to write a binary tree in memory to establish a double-stranded representation algorithm and achieve first root, the root, root, and layer after traversal algorithms. 3 using adjacency matrix used to achieve network storage, to establish a network and to achieve single-source shortest path algorithm. (2013-09-26, C/C++, 7KB, 下载18次)
本程序的主要目的是为了提供本学校的景点的路径咨询。满足用户查询的需要：
1、从石家庄经济学院的平面地图中选取出12个有代表性的景点，将其抽象成无向带权网并用邻接矩阵来表示。以图中的顶点代表景点，存放景点名称、代号、简介等信息，权值代表两地之间的距离。
2、为来访的客人提供图中任意景点相关信息的查询。当用户输入正确时，为用户输出景点的相关信息；当用户输入不合法时，提示用户输入有误并返回让用户重新输入。
3、为来访的客人提供图中任意景点的路径查询，即查询任意两个景点之间的最短简单路径。当用户输入正确时，为用户输出任意两景点的最短路径；当用户输入不合法时，提示用户输入有误并返回让用户重新输入。
4、为来访客人推荐参观路线。
The main purpose of this program is to provide the school Attractions path consulting. Meet the needs of the user query: a flat map, select Remove from the Shijiazhuang University of Economics 12 attractions, with the right network adjacency matrix to represent abstract into no. Figure the vertex representatives attractions in store attractions name, code, brief information, the right value represents the distance between the two places. Provide any the attractions related information of query in Figure 2, for visiting guests. When the user enters the correct output for the user information of the attractions prompts the user for when user input is not legitimate, and returns the user to re-enter. 3 for guests visiting any attractions path query, that query shortest simple path between any two attractions. When the user enters the correct user output arbitrary the two attractions shortest path prompts the user for when user input is not legitimate, and returns the user to re-enter. 4 (2013-01-08, Visual C++, 664KB, 下载1次)
校园局域网布线和游历问题
任务 ：用无向网表示你所在学校的主要建筑平面图，图中顶点表示主要建筑，图中的边表示建筑之间的道路，存放路径长度信息。要求能够建立校园局域网，所花的代价最小；给出任意建筑之间游历的最短路径。基本要求：
（1） 原始数据存在文件中，方便读入；
（2） 建筑物点不小于20个，边不小于30个；
（3） 分别用广度优先和深度优先的方法遍历图，起始点定为1号教学楼；
（4） 建立校园局域网，要求所花的代价最小；
（5） 查询从1号教学楼到其他各点的最短路径；
（6） 查询图中任意两个建筑间的最短路径。
The campus LAN wiring and traveled tasks: undirected said your school floor plan, said the main building of vertices and edges in the graph represents a road between the buildings, storage path length information. Requires the ability to create a campus LAN spent minimal cost given traveled the shortest path between any building. Basic requirements: (1) the original data file, easy read (2) buildings not less than 20 points, the edge is not less than 30 (3), respectively, with the breadth-first and depth-first traversal Figure as a starting point for the 1st teaching building (4) to establish a campus LAN, least costly requirements of the flower (5) query teaching from the 1st floor to the other points of the shortest path (6) any two buildings in the query graph The shortest path between. (2012-12-16, Visual C++, 921KB, 下载20次)
虚拟骨干网，包括佛罗里达大西洋大学的Jie Wu和Hailan Li 提出的关于连通控制集的算法，第二种算法是das等提出的从找到最小近似控制集到建立一个最小生成树的算法，最后一种算法是通过寻找MIS集获得CDS的方法。这三种算法提供了三种建立CDS集的方法，连通控制集（connected dominating set，CDS）作为层次路由协议中的虚拟主干是网络中保证其余节点能顺利通信的关键，它们承受更高的通信和计算负荷，网络的可靠性会因这些关键节点中的某个节点的失效而受影响。
Virtual backbone, including Jie Wu, Florida Atlantic University and Hailan Li on the connected dominating set algorithm, the second algorithm is das, etc. proposed the establishment of a minimum spanning tree algorithm to find the smallest approximate control set to the last onethe algorithm is obtained by finding the MIS set of CDS. Of the three algorithms, three kinds of CDS set, connected dominating sets (connected dominating the set, CDS), as a hierarchical routing protocol in the virtual backbone is the network to ensure that the remaining nodes can successfully communicate key, they are subjected to higher communication and the computational load, the reliability of the network due to the failure of these critical nodes in a node affected. (2012-03-01, Visual C++, 3369KB, 下载56次)
需要在某个城市n个居民小区之间铺设煤气管道，则在这n个居民小区之间只需要铺设n-1条管道即可。假设任意两个小区之间都可以铺设管道，但由于地理环境不同，所需要的费用也不尽相同。选择最优的方案能使总投资尽可能小，这个问题即为求无向网的最小生成树。
Needs in a residential area between the n cities laying gas pipelines, in the residential area between the n n-1 only the laying of the pipeline can be. Assumed between any two communities can lay the pipeline, but because of different geographical environment, the required fees are not the same. Choose the best solution to make a total investment of as small as possible, the problem is they try to net a minimum spanning tree. (2011-10-07, C/C++, 22KB, 下载10次)
校园导游咨询 [问题描述] 设计一个校园导游程序，为来访的客人提供各种信息查询服务。 [基本要求] (1)设计你的学校的校园平面图，所含景点不少于10个。以图中顶点表示校内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等相关信息。 (2)为来访客人提供图中任意景点相关信息的查询。 (3)为来访客人提供图中任意景点的问路查询，即查询任意两个景点之间的一条最短的简单路径。 [测试数据] 由个人根据实际情况自行指定。 [实现提示] 一般情况下，校园的道路是双向通行的，可设校园平面图是一个无向网。顶点和边均含有相关信息。-
this is a systerm about school (2011-09-14, Visual C++, 2KB, 下载7次)
这是一款校园导游咨询系统，首先，需要设计学校的校园平面图。一般情况下，校园通道是双向通行的，可设校园平面图是一个无向网，且边具有长度信息，如下图，所含景点不少于10个。以图中顶点表示校内各景点，存 放景点名称、代号、简介等信息；以边表示路径，存放路径长度等相关信息。然后，为来访客人提供图中任意景点相关信息的查询。最后，提供途中任意景点问路查询，即求任意两个景点间的一条最短的简单路径。
It s a Campus Guide System.. (2010-12-16, C/C++, 63KB, 下载6次)
数据结构中的图的遍历问题。
设计一个网络蜘蛛系统，用有向网表示网页的链接网络，其中，顶点表示某个网页，有向弧表示网络之间的链接关系。并且分别以a. 深度优先搜索，b. 广度优先搜索的策略抓取网页。
The graph data structure traversal problem. Design a web spider system, with a link to the web page that network, where vertices a page, there is the arc that the network link between the relationship. And depth-first search of each of a., b. breadth-first search strategy to crawl the page. (2010-08-08, Visual C++, 344KB, 下载97次)
对任意给定的图（顶点数不小于20，边数不少于30，图的类型可以是有向图、无向图、有向网、无向网），能够输入图的顶点和边（或弧）的信息，并存储到相应存储结构（邻接矩阵、邻接表、十字链表、邻接多重表，任选其中两种类型），对自己所创建的图完成以下操作：
对无向图求每个顶点的度，或对有向图求每个顶点的入度和出度（5分）
完成插入顶点和边（或弧）的功能（5分）
完成删除顶点和边（或弧）的功能（5分）
两种存储结构的转换（5分），如果其中一种存储结构为十字链表或邻接多重表则增加5分。
输出图的深度优先遍历序列或广度优先遍历序列（5分）
求图的深度优先或广度优先的生成树（或生成森林）（存储结构为孩子-兄弟链表），并对生成树进行遍历（15分）
判断图的连通性，输出连通分量的个数（5分）
判断图中是否存在环，无向图5分，有向图10分
给出顶点u和v，判断u到v是否存在路径（5分）
10、求顶点u到v的一条简单路径（10分）
11、求顶点u到v的所有简单路径（15分）
12、求顶点u到v的最短路径（10分）
13、求顶点u到其余各顶点的最短路径（15分）
14、求任两个顶点之间的最短路径（15分）
15、求最小生成树（15分）
On any given plan (not less than 20 vertices, edges not less than 30, the type of plan can be a directed graph, undirected graph, the network, not the network), can enter the vertex and edge (or arc) of the information, and stored in the corresponding storage structure (adjacency matrix, adjacency table, cross linked, adjacent to multiple tables, in which two types optional), created their own plan to complete the following:
Undirected graph on each vertex of degree requirements, or request a directed graph each vertex-degree and out-degree (5 points)
Complete the insertion of vertices and edges (or arcs) of the function (5 points)
Complete deletion of vertices and edges (or arcs) of the function (5 points)
The conversion of two storage structures (5 points), if one of the storage structure for the cross-linked or adjacent multi-table is an increase of 5 points.
Depth-first traversal output graph breadth-first traversal sequences or sequence (5 points)
Graph of the depth-fi (2010-06-05, Visual C++, 7KB, 下载59次)
用无向网表示你所在学校的校园景点平面图，图中顶点表示主要景点，存放景点的编号、名称、简介等信息，图中的边表示景点间的道路，存放路径长度信息等。
要求事先一下功能：
（1） 查询各顶点的相关信息。
（2） 查询图中任意两个景点之间的最短路径。
（3） 查询图中任意两个景点之间的所有路径。
-Free to the net means that the school campus attractions in your plans, the graph vertices of their main attractions, storage spots number, name, profile and other information, the graph edges, said the road between sites, storage path length information. Requested in advance what functions: (1) query the vertex of the relevant information. (2) query graph between any two sites the shortest path. (3) The query graph between any two spots of all paths. (2009-12-07, C/C++, 508KB, 下载3次)
用无向网表示你所在学校的校园景点平面图，图中顶点表示主要景点，存放景点的编号、名称、简介等信息，图中的边表示景点间的道路，存放路径长度等信息。要求能够回答有关景点介绍、游览路径等问题。
-Free to the net means that the school campus attractions in your plans, the graph vertices of their main attractions, storage spots number, name, profile and other information, the graph edges, said the road between sites, storage path length and other information. Requires the ability to answer questions about attractions introduction, tour path and other issues. (2009-10-15, Visual C++, 18KB, 下载9次)
(1)利用普里姆算法求网的最小生成树
(2)实现教科书中定义的抽象数据类型mfset。以此表示构造生成树过
程中的连通分量。
(3)以文本形式输出生成树中各条边以及他们的权值
(1) the use of prim algorithm for minimum spanning tree network (2) the realization of the textbook definition of abstract data types mfset. Spanning tree structure to express the process of component connectivity. (3) to text output of all spanning tree edges and their weights (2008-10-16, Visual C++, 1KB, 下载9次)
校园导游咨询
[问题描述]
设计一个校园导游程序，为来访的客人提供各种信息查询服务。
[基本要求]
(1)设计你的学校的校园平面图，所含景点不少于10个。以图中顶点表示校内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等相关信息。
(2)为来访客人提供图中任意景点相关信息的查询。
(3)为来访客人提供图中任意景点的问路查询，即查询任意两个景点之间的一条最短的简单路径。
[测试数据]
由个人根据实际情况自行指定。
[实现提示]
一般情况下，校园的道路是双向通行的，可设校园平面图是一个无向网。顶点和边均含有相关信息。
err (2008-01-07, Visual C++, 2KB, 下载60次)
1）掌握图的邻接矩阵存储结构表示和与图创建算法的c语言实现；
2）掌握普里姆（Prim）最小生成树算法(P174:算法7.9)的C语言实现及应用；
3）验证如下图5-1所示无向网的最小生成树的正确性
4）按照实验题目要求独立正确地完成实验内容（提交程序清单及相关实验数据与运行结果）；
1) The master plan of the adjacency matrix and the storage structure that plans to create algorithm c language 2) master prim (Prim) Minimum Spanning Tree Algorithm (P174: Algorithm 7.9) of the C language and application 3) the certification is as follows shown in Figure 5-1 undirected minimum spanning tree network, the accuracy of 4) in accordance with the experimental subject for independent completion of the experiment the contents of the right (to submit the list of procedures and related experimental data and results) (2007-12-29, Visual C++, 107KB, 下载11次)
c语言程序 旅游售货员问题 实验报告～区域交通网中顶点的数据域在这里不是我们关心的内容，我们关心的只是连接2个顶点的弧的代价。由于涉及到顶点间边或狐，我们可以用一个二维数组存放顶点间关系（边或弧）的数据――邻接矩阵实现该区域交通网的存储。
c language program travel salesman problem Experimental Report ~ regional transportation network in the vertex of the data field here is not our concern, we care about is connecting two vertices arc price. As it relates to inter-vertex edge or fox, we can use a two-dimensional array storing the relationship between the vertex (edge or arc) data- adjacency matrix to achieve the region s transportation network storage. (2007-12-25, C/C++, 22KB, 下载7次)