资源列表
combtang
- 这是一个生成组合序列的程序,而且是非递归的,代码非常精简,速度很快,序列是字典序的.-This is a combination of sequence generation process, but also non - recursive, code very concise, very fast, is the sequence of lexicographic.
key011
- 按键扫描驱动程序 写的还不错，希望大家看看阿！第一次上这个网，才知道这个网好好啊！-button scanning driver wrote was pretty good, we hope to see A! First on the net, before we know the net good ah!
QC2L
- 列主消元 以前写的,有耐心的就参考一下-out before the main source yuan wrote, on the patience of reference
tree
- 请你设计一下，如果解决这个“最小生成树”的问题-Design your look, if the solution to the " minimum spanning tree" problem
SY11
- 邻接表存储有向图，判断任意两结点间有无路径-Storage adjacent to the map table to determine the two arbitrary whether the path between nodes
xiangkehong
- 树与二叉树转换，用的是c++ 实现任意形状的树（使用广义表的方式从键盘输入）与二叉树的相互转换的实现-iohdiuosopidiosjdksddd
Kruscal
- 快排并查集Kruscal算法+源码 txt 快排并查集Kruscal算法+源码 txt-Row and fast algorithm+ source code search set Kruscal txt row and check the set Kruscal fast algorithm+ source code txt
1
- 将输入的文件中各奖牌得主按照奖牌的各数或者国家的字典顺序进行排序并输出-The input file each medal winner according to the number or the national medal of the order of sequence and output dictionary
tree
- 实现二叉树的建立，以及先序，后续，中序的递归和非递归遍历-The establishment of a binary tree, and the first order, follow-up, in order recursive and non recursive traversal
LCS
- 采用递归的方式，找出两个字符串序列的所有最长公共子序列-Identify all the longest common subsequence of two strings of sequence
lab2
- 动态规划法的应用 1．用动态规划法实现两个虚拟DNA序列的比对。 2．记分方法为：匹配给5分，不匹配给1分，插入、删除给－2分。 要求生成的比对具有最大总和。-The application of a dynamic programming method. Using dynamic programming method to achieve two virtual DNA sequence comparison. 2. Scoring method: match to 5 po
Huffman-decoding
- This file contains the decoding using huffman coding and is a generalized code for any set of data