资源列表
Selectquestion
- 选择问题，是算法设计与分析里的一题，是本人自己写的，绝对原创-choice, algorithm design and analysis of the one that, yes, I wrote it myself, absolutely original! !
FFTmy
- 一维离散Fourier变换快速算法的c语言实现 。-one-dimensional Fast Fourier Transform algorithm in C Language.
zhudlj
- 最短路径的分析，可以用于理解迪克杰拉和FLOYD的算法。-shortest path analysis can be used to understand and Dikejiela FLOYD algorithm.
Rplus.tar
- R+树的c实现源码，对应文章T. K. Sellis, N. Roussopoulos, C. Faloutsos: The R+-Tree: A Dynamic Index for Multi-Dimensional Objects.-R tree c achieve source code, corresponding article T. K. Sellis, N. Roussopoulos, C. Faloutsos : The R-Tree : A Dynamic Index for
TV.tar
- TV-tree的c实现源码，对应原文章K.-I. Lin, H. V. Jagadish, C. Faloutsos: The TV-Tree: An Index Structure for High-Dimensional Data.-TV-tree c achieve the source, the original corresponding article K.-I. Lin, H. V. Jagadish, C. Faloutsos : The TV-Tree : An Index S
xtree.tar
- X-tree的C++源码，对应文章S. Berchtold, D. A. Keim, H.-P. Kriegel: The X-tree : An Index Structure for High-Dimensional Data. -X-tree in C source code, the corresponding articles S. Berchtold, D. A. Keim. H.-P. Kriegel : The X-tree : An Index Structure for Hi
graphbfs
- 读图并输出图的邻接链表，输入两个结点，用广度优先寻找它们之间的最短路径并输出，并判断其是否是树，是否连通，是否有环，有要打印出来环．-interpret drawings and prints of adjacent chain, the importation of two nodes, with breadth between them priority for the shortest path and output, and a judgment whether it is trees,
dijkstrahop
- 修改ＤＩＪＫＳＴＲＡ算法，输出其过程中经过结点的个数．-revised algorithm, the process of its output after the number of nodes.
mcolor+maxtree
- 这个代码包括求图的最大生成树和Ｍ着色问题．-this code includes plans for the biggest tree and M coloring problem.
nqueensc
- Ｎ皇后问题，我们的算法实验题目，非常重要的一个算法．-N Queen's problems, our algorithm experimental subject, it is very important that an algorithm.
Soft20060207143420214
- 快速排序和冒泡排序数据结构里学的，做了船上来-Bubble rapid sequencing and scheduling data structure, the study done to the ship
my8num.RAR
- 八数码问题的深度优先算法，优秀的显示效果。-eight digital depth of the priority algorithm, showed excellent results.