[数据结构] CodeCraft-code.tar
利用最短路径算法生成车辆的最短路径，然后进行参数调整缩短车辆通过地图总时间
it is competition task in 2019 although our code is not complete but it may bring you some good ideas (2019-04-15, C/C++, 513KB, 下载1次)
[数据结构] DijkstraPath
Dijkstra算法是由E.W.Dijkstra于1959年提出,又叫迪杰斯特拉算法,它应用了贪心算法模式,是目前公认的最好的求解最短路径的方法。
Dijkstra algorithm greedy algorithm mode, is widely recognized as the best method for solving the shortest path. (2016-05-16, C/C++, 1KB, 下载1次)
[数据结构] 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次)
[数据结构] 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次)
[数据结构] stack1
用一维整数数组实现数据结构中的堆栈(Stack)。用int数组来存储栈内元素，用int来表示top和bottom。在Stack类内，实现栈的基本运算
Use a d integer array realize the data structure is the Stack). Use int array to storage stack elements in, with the top and bottom int to said. In the Stack in class, and realize the basic computing Stack
(2012-03-24, Java, 4KB, 下载5次)
[数据结构] 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次)
[数据结构] SORTING
包含如何加是插入式排序、如何在快速法中處理值相等的元素，使得排序完成之後值相等的元素仍然維持原來的順序 等等....
Includes how to add plug-in is sorted, how to deal with in the fast-law elements of equal value, the value after the completion of the same sort of elements to maintain the original order and so on .... (2009-05-27, C/C++, 23KB, 下载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次)
[数据结构] ShortPaths
用迪杰斯特拉算法求解最短路径问题，这个算法是我自己编出来的 ，感觉有很多冗余之处，请大家一起改正
Using Dijkstra shortest path algorithm, this algorithm is out of my own, I feel a lot of redundancy, please everyone together to correct (2008-09-21, Java, 1KB, 下载7次)
[数据结构] 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次)
[数据结构] erchashushixian
1. 用一个一维数组保存二叉树结点。
2. 实现二叉树节点的返回左孩子，返回右孩子，添加结点
3. 层序遍历二叉树。
1. With a one-dimensional array to preserve binary tree nodes. 2. The realization of binary tree nodes to return to the left child, return the right child, add the node 3. Binary tree traversal sequence. (2007-09-14, Java, 4KB, 下载8次)
[数据结构] 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次)