资源列表
Maze
- [rar文件] flash as3.0 求解迷宫最短路径 深度优先策略-[Rar file] flash as3.0 Solving the shortest path in the maze depth-first strategy
huffman
- 数据结构中哈夫曼数实现的详细代码，很有用，对学习很有帮助。-Detailed code of Huffman number in the data structure, very useful, very helpful for learning.
CAI
- 数据结构的书本中算法的详细CAI课件，有2种运行语言环境。-Data structure algorithm CAI courseware books, there are two kinds of running the locale.
Web-HTML2
- 跟我一起上传的WEB HTML是一起的，要一起才能一起用，学习。-With me to upload the Web HTML is together, in order to together, learning together.
integersplit
- 利用非递归算法将正整数n表示成一系列正整数之和，n=n1+n2+...+nk，其中n1>=n2>=n3>=...>=nk>=1，k>=1。 正整数n的这种表示称为正整数n的划分。 -N represents a positive integer into a series of positive integers and the use of a non-recursive algorithm, n = n1+n2+ ...+nk, wherei
bankomat
- A program for ATM . that will help you to make basic operations
LCS
- 寻找最长公共子序列的的VC++实现，使用VC6编写，采用了MFC库；输入两个字符串，输出最长子序列长度和最长子序列都有哪些-Find the longest common subsequence VC++ achieved using VC6 prepared using the MFC library What two input strings, the output longest sub-sequence length and the longest subsequence
Tree
- 二叉查找树和哈夫曼树的实现，实现节点的删除（包括根节点的删除，带有两个节点的删除，等），节点的查找，插入。-Binary search trees and Huffman tree, has implemented the deletion of nodes (including the root node is deleted, with two nodes removed, etc.), the node lookup, insertion.
QueueToJosephRing
- 用队列解决约瑟夫环的问题，使用两种方式构建队列。（C#构造）-Queue to solve the problem of Josephus, two ways of constructing the queue. (C# constructor)
Stack
- 用栈实现2个超出已有类型的数据最大值的相加-Stack to achieve two maximum sum beyond the existing types of data
ACM
- 整理的一些acm竞赛资料 参加acm竞赛能帮助程序员熟悉各种数据结构及算法 文件中有相关介绍及一些acm题解和源代码-Acm race finishing participate acm race-related presentations and some acm problem solution and source code to help programmers are familiar with a variety of data structures and algorithms f
SIR
- 复杂网络研究中的SIR传染病算法。支持Gephi的.net文件结构。-SIR epidemic algorithm in the study of complex networks. Gephi net file structure.