数据结构 网的那一部分 挺重要的哈哈哈哈哈哈哈哈哈哈哈
ggr de wa da d w e faf ewf ew af sf wa Wf rw fer j ljb ,j ,j, ,kj, , j (2019-03-16, C/C++, 1KB, 下载0次)
封装好的加权图的数据结构操作，侧重关键路径的查找，结果将会打印，值得参考和借鉴
The data structure operation of the encapsulated weighted graph, focusing on the search of the critical path, the result will be printed, worthy of reference and reference (2018-12-05, C/C++, 3KB, 下载0次)
EDA程序： 将spice网表转化为用于计算电路各种参数所需要的相应稀疏矩阵,
EDA program: the spice net table is transformed into the corresponding sparse matrix needed to calculate the various parameters of the circuit. (2018-09-06, matlab, 111KB, 下载0次)
根据旧金山路网设计的最短路径算法，可计算任意两个端点间的最短路径
The shortest path between any two endpoints can be calculated according to the shortest path algorithm designed by the old Jin Shan Road Network (2017-06-27, Visual C++, 1448KB, 下载3次)
用邻接表存储有向图并建立AOE网；
用图形的形式输出有向图；
输出关键路径和关键活动。
Adjacency table is stored AOE directed graph and the establishment of networks
In the form of graphics output directed graph
Output critical path and critical activities. (2015-12-30, Visual C++, 2KB, 下载4次)
通过数组的方式创建网，然后分别用克鲁斯卡尔和普里姆算法求得最小生成树
Create network by means of an array, and then separately in kruskal minimum spanning tree algorithm and she obtained (2014-05-20, Visual C++, 2KB, 下载3次)
一篇关于三角网格模型进行布尔运算的文章，有简单的数据结构，相关函数描述。
A triangular mesh model on Boolean article, a simple data structure, the correlation function description (2014-05-04, Visual C++, 236KB, 下载16次)
无向图应用问题
任务：如果以五向网表示n个城市之间通信网络的建设计划，顶点表示城市，边上的权表示该线路的造价，设计一个方案，使这个通讯网的总造价最低。
提示：这是一个求最小生成树的问题。n个城市名和各边的权值由用户输入，建立图的邻接矩阵，然后以Prim算法来求最小生成树，然后输出方案。
The application of an undirected graph
Task: If the five-way communications network, said network between n cities construction plan, the vertices represent cities, said the right side of the line cost, design a plan to make the lowest total cost of this communications network.
Tip: This is a minimum spanning tree problem. n cities weights on each side of the name and entered by the user to establish the adjacency matrix, then Prim algorithm to find the minimum spanning tree, and then output the program. (2013-12-31, Visual C++, 1040KB, 下载8次)
表达式求值,就是华农的OJ上的题，没办法，为了激活帐号上传的。
Expression evaluation questions on agricultural OJ, no way, in order to activate the account to upload. (2013-05-01, Visual C++, 19KB, 下载1次)
若要在n个城市之间修路，只需修n-1条线路即可。如何以最低的经济代价建设，是一个网的最小生成树
To n-1 lines, to between n cities, roads, just repair. The lowest economic cost of construction, the minimum spanning tree of a network (2012-06-19, Visual C++, 1KB, 下载4次)
二叉树的运用和介绍，虽然结构简单，但在类似淘宝网等网站开发中应用广泛
The the the use of and presentation of of of the binary tree, Although the the structure is simple, but wide range of applications with the in the similar Taobao, and other web site development (2012-06-15, Visual C++, 1KB, 下载2次)
AOE关键路径，数据结构课程设计，使用MFC界面，图形化操作。有实验报告。
AOE critical path program. my project for Data Structure. Using MFC UI, Operate in GUI. It contain a report. (2012-04-18, Visual C++, 1087KB, 下载41次)
用普里姆算法从第u个顶点出发构造网G的最小生成树T,输出T的各条边
Primm algorithm with u vertices starting from the first network constructed minimum spanning tree of G T, the output of the edge T (2011-07-01, Visual C++, 2KB, 下载1次)
1. 用连通网来表示n个城市以及n个城市间可能设置的通信线路,其中网的顶点表示城市,边表示两诚实之间的线路,赋于边的权值表示相应的代价.最小生成树问题就是要构造连通网的最小代价生成树.
1. Used to represent the n-connected network of n cities and between cities and communication lines may be set, including vertex network, said the city, said the two sides of the line between honest, confers the right side of the value that the corresponding cost. Smallest tree problem is to construct minimum cost connected network spanning tree. (2010-06-07, DOS, 408KB, 下载3次)
KRUSCAL算法实现演示程序，利用KRUSCAL算法求网的最小生成树，网中的节点和边由系统自动生成，图为带权图。
KRUSCAL algorithm demo program, using KRUSCAL minimum spanning tree algorithm to solve network, network nodes and edges generated automatically by the system, photo shows a weighted graph. (2010-05-02, C++, 2KB, 下载4次)
用顶点表示事件，弧表示活动，弧上的权值表示活动持续的时间的有向图叫AOE 。AOE网常用于估算工程完成时间。可通过本算法来计算关键路径
Activity On Edge Network (2009-07-02, Visual C++, 3KB, 下载7次)
PRIM算法 对任意给定的网和起点，用PRIM算法的基本思想求解出所有的最小生成树。
PRIM algorithm for any given network and the starting point, PRIM algorithm used to solve the basic idea of all the minimum spanning tree. (2009-01-11, Visual C++, 599KB, 下载17次)
湖南大学ACM-OJ的部分题目代码，对学习数据结构和算法很有帮助
Hunan University ACM-OJ part of the subject code, the data structure and algorithm to learn helpful (2008-10-26, Visual C++, 18KB, 下载10次)
普里姆构造最小生成树算法 图或网的邻接矩阵表示及其上基本算法的实现
prim minimum spanning tree algorithm tectonic map of the network or matrix and adjacency on the realization of basic algorithm (2007-07-02, Visual C++, 3KB, 下载7次)
数据结构课程设计，求无向网最短路径，利用c++6.0编程环境
data structure curriculum design, without seeking the shortest path to the net, using c 6.0 programming environment (2005-04-06, Visual C++, 2KB, 下载43次)