根据迪杰斯特拉计算经景点最短路径 并显示路径
According to Dijkstra shortest path calculated by the attractions and shows the path (2015-09-26, Visual C++, 302KB, 下载1次)
求图的最小生成树的克鲁斯卡尔算法，数据结构程序
Find the minimum spanning tree diagram of the Kruskal algorithms, data structures, program (2014-04-09, Visual C++, 8KB, 下载4次)
数据机构中克鲁斯卡尔算法的源代码，隶属于图这一章节。
Data institutions Kruskal algorithm source code, under the figure of this chapter. (2013-06-20, Visual C++, 178KB, 下载1次)
kruskal算法 克鲁斯卡尔算法 最小生成树 C语言程序
kruskal algorithm Kruskal minimum spanning tree algorithm C language program (2013-05-22, Visual C++, 1KB, 下载2次)
克鲁斯卡尔算法，用c++实现，适用于本科数据结构教学。
Kruskal，implemented by C++， can be used in the course of DS of college students (2013-03-30, Visual C++, 1KB, 下载2次)
概率加回溯法求解八皇后问题，前k步使用概率法，后8-k步使用回溯法
Probability and backtracking to solve the eight queens problem, k steps before using the probability method, after the 8-k step backtracking (2013-01-06, Visual C++, 1KB, 下载1次)
弗洛伊德和迪杰斯科拉特算法
vs2010实测通过很完美的哦
Floyed and Dijstra algorithm
vs2010 measured
perfect (2012-12-21, Visual C++, 2011KB, 下载2次)
迪杰斯特拉算法实现有向图的的最短路径并在图上表示
Dijkstra algorithm to FIG shortest path represented in FIG. (2012-12-01, Visual C++, 408KB, 下载2次)
这个是数据结构中的一个例子：一维数组应用。主要是排序，例如冒泡法排序。
This is an example of the data structure: a one-dimensional array application. Mainly sort, such as bubble method to sort. (2012-11-16, Visual C++, 32KB, 下载3次)
运用迪杰斯特拉算法求出图中的最短路径，最短路径的求法
Use Dijkstra algorithm to find the shortest path in Figure (2012-06-26, Visual C++, 4KB, 下载2次)
运动会开了N天，一共发出金牌M枚。第一天发金牌1枚加剩下的七分之一枚，第二天发金牌2枚加剩下的七分之一枚，第3天发金牌3枚加剩下的七分之一枚，以后每天都照此办理。到了第N天刚好还有金牌N枚，到此金牌全部发完。编程求N和M。
The Games opened a N days, issued a total of gold medals M missiles. The first day of hair gold medal-sevenths of a 1 plus the rest of the next day, hair-sevenths of a gold medal in the two plus the rest of the first three days of three plus the rest of the gold medal-sevenths of a future every day to do the same. To N days just there the gold medal, N pieces of this gold medal is all finished. Programming request N and M. (2012-05-21, Visual C++, 1KB, 下载2次)
. 定义一个int型的一维数组，包含40个元素，用来存储每个学员的成绩，循环产生40个0~100之间的随机整数，
将它们存储到一维数组中，然后统计成绩低于平均分的学员的人数，并输出出来。
Define a one-dimensional array of type int, contains 40 elements, used to store the results of each student, cycling between 40 0 ??to 100 random integer, store them to a one-dimensional array, then the low statistical results in the average number of students, and output them. (2011-10-28, Visual C++, 444KB, 下载2次)
贝尔曼福特 和 迪杰斯特拉 单源最短路径算法的实现
single source shortest path algorithm，Bellman Ford and Dijkstra (2011-09-08, Visual C++, 6KB, 下载2次)
程序输入任意一个数n，都可以自动生成一个n维的矩阵，满足类似九宫格的排列
Program input any number n, can automatically generate an n-dimensional matrix, arranged to meet a similar Jiugongge (2011-07-28, Visual C++, 212KB, 下载4次)
求两点之间的所有路径，采用dfs深度搜索加回溯
Find all paths between two points, the depth of the search plus backtracking by dfs (2010-12-10, Visual C++, 1229KB, 下载24次)
最短路径克鲁斯卡尔算法的实现，输入一张图，会自动进行算法计算
Kruskal shortest path algorithm, input a graph algorithm automatically (2010-10-25, Visual C++, 1KB, 下载2次)
POJ3268题解。因为只有1000，所以可以两次迪杰斯特拉搞定，哈哈
POJ3268 problem solutions. Because only 1000, so you can Dijkstra buttoned twice, ha ha (2010-06-01, Visual C++, 14KB, 下载2次)
复数四则运算。实现复数的加，减，乘。根据输入的复数分离出实部和虚部。。
Complex four operations. Achieve the plural add, subtract, multiply. Based on the input of the complex separated real and imaginary parts. . (2010-03-25, Visual C++, 1KB, 下载3次)
数据结构中的迪杰斯特拉最短路径算法的代码，大作业之一
Data structure of Dijkstra' s shortest path algorithm code, the one (2009-06-30, Visual C++, 3KB, 下载8次)
手动输入，用普利木和克鲁斯卡尔算法求最小生成树
Manual input, with perindopril for wood and Kruskal minimum spanning tree algorithm (2009-06-02, Visual C++, 4KB, 下载1次)