资源列表
huiwenshu
- 回文数的判断，用栈和队列做的！希望大家可以互相交流一下-Palindrome number of judgments, with stacks and queues to do! Hope that we can exchange what
include
- 定义一个栈，并实现栈的基本操作： void Push( const T& x) // bool Pop(T& x) // bool getTop(T& x) const // ostream& operater<<(ostream& os, Stack<T>& s) //overload -The definition of a stack, and to achieve the basic operation of the stack: void P
fzjx
- 货郎担问题的分支限界算法，速度很快，并且结点可以到达35个-The branch and bound algorithm for traveling salesman problem, very fast, and the node can reach 35
hfjdu
- 求最短路径的最优算法，自己下下就知道了 -the neareat road
zhongzhuizhuanhouzhui
- 中缀表达式转后缀表达式，数据结构中堆栈的应用。-Switch to postfix infix notation expressions, the data structure stack applications.
stationery_management_system
- 数据结构课程设计，文具店管理系统,自己写的程序，方便大家使用。-Data structure the curriculum design, stationery shop management system, its own written procedures to facilitate people to use.
data
- 数据结构的课程设计，是实现二叉树的数据结构，包括文档。-Data structures course design is to achieve binary tree data structure, including the documentation.
sjjgsy
- 数据设计课程实验，二叉树存储设计源码，c语言编写。-Data design course experiments, binary storage design source, c language.
SpanningTree
- 先构造一个图 用邻接矩阵存储 然后用分别普利姆算法和克努斯卡尔算法构造其最小生成树-First construct a map with the adjacency matrix is stored separately plym algorithm and then construct the minimum spanning tree algorithm克努斯卡尔
GList
- 广义表的头文件简单实用，一般般的操作都有说明。-Generalized table header file is simple and practical, generally have been described as the operation.
HugeInt
- HugeInt struct used to store approx. infinite integers and is operator overloaded.
Structure
- Implementation of StudentArray struct.