一些常见算法实现和牛客网以及leetcode刷题
Some Common Algorithms Implementing and Title Brushing (2018-12-24, Python, 235KB, 下载1次)
输入任意的一个网，用普里姆(Prim)算法构造最小生成树。
Enter any of a network, with Prim (Prim) minimum spanning tree algorithm. (2014-04-04, Visual C++, 33KB, 下载7次)
AOE网求关键路径数据结构实训源代码VC即可运行
AOE network critical path data structure training to run the source code VC (2013-12-22, Visual C++, 5KB, 下载3次)
由于换季，ACM商场推出优惠活动，以超低价格出售若干种商品。但是，商场为避免过分亏本，规定某些商品不能同时购买，而且每种超低价商品只能买一件。身为顾客的你想获得最大的实惠，也就是争取节省最多的钱。经过仔细研究过，我们发现，商场出售的超低价商品中，不存在以下这种情况：
N(3<=n)种商品C1,C2,…,Cn，其中Ci和Ci+1是不能同时购买的(i=1,2,…,n-1)，而且C1和Cn也不能同时购买。
请编程计算可以节省的最大金额数。
shoping lest (2013-09-24, C/C++, 1KB, 下载1次)
tin三角网的C语言TC环境下的生成算法
tin triangulation of the C language environment of the generation algorithm TC (2013-08-03, Visual C++, 4KB, 下载3次)
Kruskal森林类
用Kruskal算法构造网net的最小代价生成树
Kruskal forest types using the Kruskal algorithm constructs a minimum cost spanning tree network net (2013-07-10, Visual C++, 2KB, 下载1次)
1． 利用克鲁斯卡尔算法求网的最小生成树。
2． 利用普里姆算法求网的最小生成树。
3． 要求输出各条边及它们的权值。
1. Using Kruskal algorithm for the minimum spanning tree network. 2. Use of the the prim algorithm for the minimum spanning tree. 3. Output edge and their weights. (2013-05-11, Visual C++, 621KB, 下载2次)
用C语言实现已知N个点自动生成一个三角网
The known N points C language automatically generates a triangular network (2012-12-27, Visual C++, 2218KB, 下载2次)
若要在n个城市之间建设通信网络，只需要假设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。
To build a communication network between the n cities, only need to assume a n-1 lines can be. Construction communication network at the lowest economic cost of the minimum spanning tree of a network problem. (2012-12-14, Visual C++, 892KB, 下载8次)
数据结构中各种图的建立，包括无向图，有向图，网等
Map of the various data structures, including undirected graphs, directed graphs, networks, etc. (2012-07-03, Visual C++, 228KB, 下载2次)
若要在6个城市之间建立通信网络，只需要架设5条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题
To establish communication networks between 6cities, only need to set up the 5 lines can be. The lowest economic cost of construction communication network is a network of minimum spanning tree problem (2012-06-19, Visual C++, 1KB, 下载2次)
若要在n个城市之间建立通信网络，只需要架设n-1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题
To establish communication networks between n cities, only need to set up the n-1 lines can be. The lowest economic cost of construction communication network is a network of minimum spanning tree problem (2012-06-19, Visual Basic, 1KB, 下载10次)
关键路径算法，采用邻接表结构存储图。计算最早发生时间和最晚发生时间，最终算得关键路径
Critical path algorithm, using the adjacency list structure is stored map. The calculation of the earliest and latest time of occurrence, and ultimately be regarded as the critical path (2012-05-24, Visual C++, 3KB, 下载8次)
最短路径
----因特网最短路径优先(OSPF)路由算法的实现
---- Internet shortest path shortest path first (OSPF) routing algorithm to achieve (2011-09-20, Visual C++, 156KB, 下载13次)
对二叉树进行拓扑排序，AOV网和拓扑排序算法
The topology of the binary tree sort, AOV network and the topological sort algorithm (2011-06-12, Visual C++, 132KB, 下载3次)
路由表算法设计实现，计算机通信网课程设计可用的到
Routing table algorithm design and implementation, curriculum design of computer communication networks available to (2010-12-30, C/C++, 2KB, 下载3次)
校园网设计方案，我的的课程设计，还不错，下载看看去
Campus network design, the design of my course, well, look to download (2010-12-29, Visual C++, 5KB, 下载3次)
1． 利用克鲁斯卡尔算法求网的最小生成树。
2． 利用普里姆算法求网的最小生成树。
3． 要求输出各条边及它们的权值。
1. Using Kruskal' s algorithm for minimum spanning tree network. 2. Prim algorithm for the use of the minimum spanning tree network. 3. Requirements of the output of each side, and their weights. (2009-06-18, Visual C++, 20KB, 下载13次)
这是一个关于魔王语言的游戏。是关于一个数据结构的问题。
This is a game on the Devil language. On a data structure. (2008-11-13, C/C++, 51KB, 下载1次)
数据结构课程设计 排序算法的 比较 完整 源码加文档
Data structure the curriculum design of the sorting algorithm relatively complete source code plus documentation (2008-07-01, C/C++, 32KB, 下载73次)