资源列表
HungaryAlgorithm
- 匈牙利算法，实现求二分图最大匹配，还有一些资料，实现的语言是C-Hungarian algorithm, seeking to achieve the maximum bipartite matching, there are some data to realize the language is C++
Infix_expression_into_postfix_expression_calculati
- 利用栈将中缀表达式转化成后缀表达式并计算-Using the stack to postfix infix expression into an expression and calculate
cordic
- 用CORDIC算法来计算正弦和余弦函数，稍加修改还可计算其他函数-CORDIC algorithm is used to calculate the sine and cosine functions, other functions can be calculated slightly modified
paixu
- 排序 1.简单选择排序 2.冒泡法排序 3.直接插入排序 4.希尔排序 5.快速排序 6.退出程序 -Rank 1. Simple selection sort 2. Bubble sort method 3. Directly into the sort 4. Hill Rank 5. Quicksort 6. Exit
code14958
- 最短路径选择算法 VB写的Dijkstra最短路径选择算法 GIS开发人员一点帮助-fdgfdgfdgfd
xiaoyuandaohang
- 用无向图表示你所在学校的校园景点平面图，图中顶点表示主要景点，存放景点的编号、名称、简介等。 设计要求： 1．查询各景点的相关信息 2．查询图中任意两个景点间的最短路径 3．查询图中任意两个景点间的所有路径 -Undirected graph with the school' s campus attractions in your plan, said the main attractions of vertices, stored spots number, nam
sy1201
- 求两点的距离以及求三角形三个顶点的坐标，三边的周长和面积-The distance between two points and the demand requirements of the coordinates of the triangle of three vertices, three sides of the perimeter and area
Select
- 给定一个线性序列集，要求求出其中指定的第k小的数的值和位置.如给定n个元素和一个整数i，1≤i≤n，输出这n个元素中第i小元素的值及其位置；-A linear sequence of a given set of requirements specified in paragraph k of which obtained a small number of value and location. If the given element and an integer n i, 1 ≤ i ≤
MapCreation
- 图的创建，深度优先和广度优先搜索，有实验报告-Map creation, depth-first and breadth-first search, there are experimental reports
multi_file_op_bitree
- 一个很好的二叉树的程序，可以在vc++6.0环境下执行，可以创建，先序，中序，后序遍历，还可以输出树的叶子节点，按树状打印该二叉树-A good binary tree program, you can run under vc++6.0, you can create, the first order, in order, after traversing, you can output the tree leaf node, print the binary tree by tree
BtreeC
- 本程序实现B+树的建立，插入，删除，查找、旋转等操作。-The Program for the establishment of B+ tree, insert, delete, find, rotation and other operations.
ch02_LinerList
- 队列，包含线性队列、环形队列、顺序、静止等等。-ch02_LinerList.rar