[数据结构] PaskaTriangle
帕斯卡三角，数据结构算法经典。代码用递归和不用递归两种方式，可比较两种实现的性能和空间上的差异。
Pascal' s triangle, the data structure classical algorithm. Without using recursive and recursive code in two ways, the differences can compare the two to achieve the performance and space. (2014-05-28, Visual C++, 282KB, 下载3次)
[数据结构] dijst
程序是使用类实现迪杰斯特拉算法计算图的最短路径问题。但是图的结点数默认为6，可自行修改。
Program is to achieve the shortest path problem using Dijkstra algorithm class diagram. However, the default is the number of nodes in Figure 6, you can modify. (2014-04-26, Visual C++, 250KB, 下载3次)
[数据结构] Matrix
把一个N*N的三角矩阵按列的方式映射到一个3N*2的一维数组，功能设置，输入输出、存储搜索、加减乘、转置。
Put an N* N triangular matrix is mapped to the column by way of a one-dimensional array of 3N* 2, the feature set, input and output, storage, search, add and subtract multiply, transpose. (2014-04-13, Visual C++, 1KB, 下载5次)
[数据结构] shortroute
一个求最短路径的程序，使用了广度优先搜索，深度优先搜索和帝斯卡尔算法来求出一张图的最短路，是一个范例程序
A shortest path, the use of a breadth-first search, depth-first search algorithm to find a Dili Scalzi shortest figure is a sample program (2013-09-08, Visual C++, 28KB, 下载2次)
[数据结构] JosephusProblem
用C程序解决约瑟夫斯问题，是一个出现在计算机科学和数学中的问题。在计算机编程的算法中，类似问题又称为约瑟夫环。
In computer science and mathematics, the Josephus Problem (or Josephus permutation) is a theoretical problem related to a certain counting-out game.
(2013-01-09, Visual C++, 97KB, 下载1次)
[数据结构] Dijkstra
Dijkstra杰斯拉特的贪心算法程序，实现含权有向图G=(V,E)中顶点到其余顶点的距离。
The greedy algorithm Dijkstra Jess Lats procedures with the right vertex to the rest of the distance from the vertex to Figure G = (V, E). (2013-01-05, Visual C++, 1KB, 下载2次)
[数据结构] erchashudebianli
用非递归法实现二叉树的遍历
非递归算法中,必须设置堆栈,可以直接用一维数组来代替栈,但必须另外设置栈顶指针。
Non-recursive method of binary tree traversal non-recursive algorithm, you must set the stack, which enables the direct use of one-dimensional array instead of the stack, but must also set the stack pointer. (2012-06-15, Visual C++, 1KB, 下载2次)
[数据结构] Minimum-spanning-tree
已知一个无向网，求该网的最小生成树，该程序使用的是克鲁斯卡尔算法，求的的最小生成树
A no known to the nets, for the nets minimum spanning tree, the program is using cruise Carl algorithm, and of the minimum spanning tree
(2012-05-25, Visual C++, 240KB, 下载4次)
[数据结构] good
第4章 数组
1. 定义一个int型的一维数组，包含10个元素，分别赋一些随机整数，然后求出所有元素的最大值，
最小值，平均值，和值，并输出出来。
Chapter 4 Array 1. Define a one-dimensional array of type int, contains 10 elements, respectively, assigned some random integer, then find all the elements of the maximum, minimum, average, and values, and output them. (2011-10-28, Visual C++, 1KB, 下载5次)
[数据结构] CPP_map
图的基本结构，及基本操作，包括最短路径树，最小生成树的Prim算法和克鲁斯卡尔算法
Map the basic structure and basic operations, including the shortest path tree, Prim' s minimum spanning tree algorithm and Kruskal algorithm (2011-08-16, Visual C++, 1732KB, 下载8次)
[数据结构] primkruskal
用克鲁斯卡尔（kruskal)算法求N个结点所联成的加权无向图的最小生成树，核心代码比较简单。
Using Kruskal (kruskal) algorithm to solve the N nodes are linked to form a weighted undirected graph of the minimum spanning tree, the core code simple. (2010-06-05, Visual C++, 2KB, 下载2次)
[数据结构] KSPsuanfa
在现实生活中，可以通过交通工具直达的两个城市之间，虽然距离可能最短但是价格却不一定是最便宜的。譬如，曾有同学去加拿大多伦多，从上海国际机场起飞，转由韩国首尔飞往加拿大，机票会比从中国直飞加拿大便宜3千多RMB。
本课题基于此种实际问题展开分析，对于旅游路线的时间和费用分别讨论，根据需要，给出用户所查询的最快的路线或最节省的路线。 在此基础上，筛选出优惠价格在N（N由用户决定）元，路径上节点最少的方案，即中转站最少。考虑到实际应用中
In real life, by direct transport between the two cities, although the shortest distance possible price but not necessarily the cheapest. For example, students had to Toronto, Canada, from Shanghai International Airport, transfer to Seoul, South Korea to Canada, tickets will be non-stop Canada from China more than 3 more than 1000 low RMB. The subject of such practical issues based on the analysis of tourist route for the time and cost, respectively, according to the needs of queries given by users of the routes the fastest route or the most savings. On this basis, the selected price in the N (N a decision by the user) yuan, the path of the program on the nodes at least, that is, at least a transit point. Taking into account the practical application (2009-06-30, Visual C++, 7102KB, 下载45次)
[数据结构] cr
此程序主要查实现插入排序，过程为依次输入集合A和B的元素，在一维数组space中建立表示集合(A-B)∪(B-A)
This procedure to achieve the main search Insertion Sort, process followed by the importation of a collection of elements A and B, in the one-dimensional array to create a space that the collection of (AB) ∪ (BA) (2009-05-28, Visual C++, 1KB, 下载1次)
[数据结构] zuixiaoshengchengshu
1． 利用克鲁斯卡尔算法求网的最小生成树
2.以存储边（带权）的数组表示图
1. Kruskal algorithm using minimum spanning tree for network 2. To store edge (with the right of) the array that map (2009-05-24, Visual C++, 258KB, 下载8次)
[数据结构] algorithms
包罗各种算法，相当全面，可以下载看看，具体有单元加、求进制、汉诺塔、底层编程、小写数字转为大写数字、数据结构、算法基础等等。
Cover a variety of algorithms, is very comprehensive and can be downloaded to see the specific unit plus, and band, Tower of Hanoi, the underlying programming, lower case to upper case the number of figures, data structures, algorithms, etc. basis. (2009-04-18, Visual C++, 316KB, 下载2次)
[数据结构] homework2_2
用链表(单向链表或双向链表)实现
多项式之间的运算包括：多项式之间的加、减、乘、除*法等
Use linked lists (one-way or two-way linked list) between the computing polynomial realize include: polynomial between the add, subtract, multiply, divide, etc.* Act (2008-03-09, Visual C++, 35KB, 下载27次)
[数据结构] data_structure
目录:
单元加
字符
底层编程
效验算法
数学问题
数据结构
数组
文件程序
求进制
汉诺塔
硬币情况
逆阵
问题算法
小写数字转为大写数字
其它
Directory: Add characters in the bottom of unit programming algorithm for mathematical problem-tested data structure for hexadecimal array documentation procedures coins situation Tower of Hanoi problem inverse matrix algorithm lowercase to uppercase figures the number of other (2007-09-30, Visual C++, 309KB, 下载50次)
[数据结构] hafumanbianma.rar
哈夫曼编码/译码 利用克鲁斯卡尔算法计算信息的哈夫曼编码，以便更好的利用通信信道。
Huffman encoding/decoding algorithm using Kruskal Huffman encoding of information in order to better use of communication channel. (2007-07-18, Visual C++, 13KB, 下载3次)
[数据结构] biaodashqiuzhi
算术表达式求值的程序，用栈实现的，可以进行加、减、乘、除、乘方、求余计算，支持小数和括号 （数据结构作业）
arithmetic expression evaluates the procedures used stack to achieve, and can be, plus or minus, multiplication, addition, the involution, for I, support minority and brackets (data structure operations) (2006-11-05, Visual C++, 1KB, 下载89次)
[数据结构] TriMat
在目录“\上三角矩阵类的实现”中给定了文件triMat.cpp、triMat.h，请把triMat.h文件中的9个填空位置补上正确的代码，使triMat.cpp能完成上三角矩阵的加、减、乘运算。要求输入：
输入矩阵维数：4
输入矩阵a的元素（包括0）：
1 2 3 4
0 1 2 3
0 0 1 2
0 0 0 1
输入矩阵b的元素（包括0）：
1 2 3 4
0 1 2 3
0 0 1 2
0 0 0 1
in the directory "\ triangular matrices on the achievement," given the document triMat.cpp. triMat.h invited to triMat.h documents fill up the nine positions make up the correct code, so triMat.cpp complete triangular matrix on the addition, subtraction, multiplication. Importation : input matrix dimension : a four input matrix elements (including 0) : 1 2 3 4 0 1 2 3 0 0 1 2 0 0 0 1 b of the input matrix elements (including 0) : 1 2 3 4 0 1 2 3 0 0 1 2 0 0 0 1 (2006-06-01, Visual C++, 572KB, 下载3次)