问题描述：给定一个地区的n个城市间的距离网，用Prim算法或Kruskal算法建立最小生成树，并计算得到的最小生成树的代价。
基本要求：
1、城市间的距离网采用邻接矩阵表示，邻接矩阵的存储结构定义采用课本中给出的定义，若两个城市之间不存在道路，则将相应边的权值设为自己定义的无穷大值。要求在屏幕上显示得到的最小生成树中包括了哪些城市间的道路，并显示得到的最小生成树的代价。
2、表示城市间距离网的邻接矩阵（要求至少6个城市，10条边）
3、最小生成树中包括的边及其权值，并显示得到的最小生成树的代价。
Problem Description: given the distance network between n cities in a region, the minimum spanning tree is established by prim algorithm or Kruskal algorithm, and the cost of the minimum spanning tree is calculated.
Basic requirements:
1. The distance network between cities is represented by adjacency matrix, and the definition of adjacency matrix storage structure is given in the textbook. If there is no road between two cities, the weight of the corresponding edge is set to its own infinite value. It is required to display the roads between cities in the minimum spanning tree and the cost of the minimum spanning tree.
2. Adjacency matrix representing distance network between cities (at least 6 cities and 10 edges are required)
3. The minimum spanning tree includes the edges and their weights, and shows the cost of the minimum spanning tree. (2020-12-25, C/C++, 232KB, 下载1次)
本文通过给定的训练模式为例来推导bp网络学习的算法,并用(语言编程实现,运行程序给出学习误差曲线,最后指出实际应用中BP网
In this paper, the BP network learning algorithm is deduced by a given training model, and the learning error curve is given by the language programming. Finally, it is pointed out that BP neural network is applied in practice. (2018-08-04, Others, 211KB, 下载0次)
利用图状结构存储数据，并实现迪杰斯特拉算法来求解最短路径。
用带权的有向图表示一个交通运输网，图中：
顶点——表示城市
边——表示城市间的交通联系
权——表示此线路的长度或沿此线路运输所花的时间或费用等
问题：从某顶点出发，沿图的边到达另一顶点所经过的路径中，各边上权值之和最小的一条路径——最短路径。
The graph structure is used to store data and the Dijkstra algorithm is used to solve the shortest path.
A weighted transport directed graph is used to represent a transportation network.
Vertex - a city
Edge - the traffic links between cities
Right -- indicating the length of the line or the time or cost of transportation along the line.
Problem: from a certain point, the shortest path is the path with the lowest weight on every side of the path along the edge of the graph reaching the other vertex. (2018-05-08, C/C++, 5KB, 下载1次)
网易云课堂-陈越、何钦铭-数据结构-2016春
PTA-04-树5 Root of AVL Tree
编译器：python2
An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one if at any time they differ by more than one, rebalancing is done to restore this property. Figures 1-4 illustrate the rotation rules. (2016-04-12, Python, 2KB, 下载1次)
主要是利用加权有向图对城市交通网进行建模，通过求解交通导航问题，熟悉图结构的储存、表示和操作，同时加深理解加权有向图的连通性判断和全源最短路径算法。
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次)
给定一个地区的n个城市间的距离网，用Prim算法或Kruskal算法建立最小生成树，并计算得到的最小生成树的代价
The distance between the network to set a region of n cities, Prim' s algorithm or Kruskal' s algorithm to create a minimum spanning tree, and the calculation of the cost of the minimum spanning tree (2013-04-17, Visual C++, 2KB, 下载2次)
校园导航问题
设计目标：
设计学校的平面图，至少包括10个以上的场所，每两个场所间可以有不同的路，且路长也可能不同，找出从任意场所到达另一场所的最佳路径（最短路径）。
基本要求一般情况下，校园的道路是双向通行的，可设计校园平面图是一个无向网。顶点和边均含有相关信息。
（1）定义数据结构：设计校园平面图，在校园景点选10个左右景点。以图中顶点表示校园内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等有关信息。
（2）为来访客人提供图中任意景点相关信息的查询。
（3）为来访客人提供任意景点的问路查询，即查询任意两个景点之间的一条最短路径。
Campus navigation design objectives: a plan view of the design schools, including at least more than 10 places, between each two sites may have a different way, and the path length may also be different to identify the best path to reach another place from any place (shortest path). The basic requirements under normal circumstances, the campus road is two-way traffic, design campus plan is an undirected network. Vertices and edges contain relevant information. (1) the definition of data structures: design campus plan attractions on campus at about 10 attractions. Campus attractions, attractions store name, Code brief side of said path, storage path length and other information about the vertices in the graph. (2) information query any attractions for visiting guests. (3) any attractions for visiting guests ask for directions query, that query a shortest path between any two attractions. (2012-12-22, Visual C++, 6KB, 下载6次)
数据结构、AOE、关键路径。
求关键路径
读入ＡＯＥ网数据，建立其邻接表存储结构；
输出各关键活动的起点编号、终点编号和权；
输出最短工期；
Data structure, AOE, the critical path. Finding the Critical Path reads the AOE network data, establish its adjacency list storage structure output the shortest duration of the output of the key activities starting point number, end number and the right (2012-10-14, C/C++, 2KB, 下载10次)
最小生成树的数据结构解法，若要在n个城市之间建设通信网络，只需要架设n－1条线路即可。如何以最低的经济代价建设这个通信网
The data structure of the minimum spanning tree solution, To the construction of communications networks, and only need to set up the n-1 lines can be between the n cities. The communication network at the lowest economic cost of construction (2012-09-03, Visual C++, 5KB, 下载4次)
考虑右边的无向网，设计算法输出从顶点a到顶点i的一条带权路径长度最短的简单路径.采用递归或非递归的深度优先或广度优先遍历算法扩展实现
Consider the right to the network design algorithm output realization of recursive and non recursive depth-first or breadth-first traversal algorithm extensions from the vertex a to vertex i, a weighted path length of the shortest simple path. (2012-06-01, Visual C++, 2KB, 下载5次)
本程序实现了用数据结构中的图形知识编写一个求无循环有向帯权图（即通常所说的AOE网）中从起点到终点所有路径，经分析、比较求出长度最大路径，从而求出关键路径。
This code is used to calculate the every path from the starting piont to the ending piont of an AOE Figure,then carry out the maximum path
after analysizing and comparing,and then calculate the critical path.
(2012-03-05, Visual C++, 2KB, 下载4次)
用无向图表示n个城市之间的交通网络建设规划，顶点表示城市，边上的权表示该线路的造价，试设计一个方案，使得这个交通网的总造价最小，即求最小生成树问题。
Undirected graph with n cities that traffic between the network construction plan, the vertices represent the city, right next to that the cost of the line, try to design a program, making the total cost of this transportation network minimum, that is seeking the minimum spanning tree problem . (2011-10-25, Visual C++, 13KB, 下载2次)
因特网最短路径优先(OSPF)路由算法的实现：根据给定的网络拓扑图求某路由器到其它路由器的最短路径，并生成路由表
Internet Shortest Path First (OSPF) routing algorithm to achieve: given the network topology of a router to other routers find the shortest path, and generate routing tables (2011-09-21, Visual C++, 10KB, 下载33次)
最小生成树的数据结构解法，若要在n个城市之间建设通信网络，只需要架设n－1条线路即可。如何以最低的经济代价建设这个通信网
Minimum spanning tree method of data structure, to cities in the n-building communications between the network only need to set up n-1 lines to. How to minimize the economic cost of building the communications network (2009-05-06, Visual C++, 3KB, 下载18次)
最短路径问题（用无向图表示n个城市之间的交通网络建设规划，顶点表示城市，边上的权表示该线路的造价，试设计一个方案，使得这个交通网的总造价最小。）
The shortest path problem (with undirected graph n cities that transport links between the construction plan, vertex, said city, said the right edge of the construction cost of the line and try to design a program, making the transport network of the total cost of the smallest.) (2009-01-13, Others, 13KB, 下载30次)
二叉树上结点的路径,航班信息的查询与检索,赫夫曼编码的应用,AOE网,大整数计算5个数据结构里比较实际的编程例子,自己写的
Binary tree node on the path, flight information query and retrieval, the application of Huffman coding, AOE network, large integer calculation 5 data structure more practical programming examples written in their own (2008-03-14, Visual C++, 9KB, 下载11次)
[实验目的]
1. 熟悉图的存储结构
2. 掌握图的最短路径算法
[实验内容]
用无向网表示学校的校园景点平面图，图中顶点表示主要景点，存放景点的编号、名称、简介等信息，图中的边表示景点间的道路，存放路径长度等信息。要求能够回答有关景点介绍、游览路径等问题。
[实验要求]
1 查询各景点的相关信息；
2 查询图中任意两个景点间的最短路径。
3 查询图中任意两个景点间的所有路径。
[Experimental purposes] 1. Familiar with the storage structure of Figure 2. To master plan the shortest path algorithm [experimental content] free to the net means that schools Attractions plan, map, said the main attractions vertex, store the number of spots, names, profile, etc. information, the figure that the attraction between the edges of roads, storage of information such as path length. Asked to answer questions about attractions, the tour path and so on. [Experiment] 1 query the various scenic spots in the relevant information 2 query graph between any two spots of the shortest path. 3 query graph between any two spots of all the paths. (2008-01-08, Visual C++, 4KB, 下载29次)
利用克鲁斯卡尔算法求网的最小生成树
是关于数据结构的课程设计的题目
是非常有用的
Kelushikaer algorithm for the use of the network is the minimum spanning tree data structure of the curriculum design is the subject of very useful (2005-11-17, Visual C++, 1KB, 下载1149次)
最小生成树的数据结构解法，若要在n个城市之间建设通信网络，只需要架设n－1条线路即可。如何以最低的经济代价建设这个通信网
minimum spanning tree data structure solution, if a n cities between building communications networks needed to put up only n-1 line can be. How the lowest economic cost of building the communications network (2005-06-30, Visual C++, 2KB, 下载109次)