资源列表
K_Medoids
- K-medoids算法的实现，c++实现-K-medoids cluster algorithm
流函数计算
- 流函数计算.rar
以二叉链表作存储结构
- 以二叉链表作存储结构，编写一个算法将二叉树左、右子树进行交换的算法。-Write an algorithm to binary trees left and right subtree exchange algorithm for binary list storage structure.
Maze
- 本代码在IAR编译环境下编译，实现电脑鼠走迷宫，能够准确的到达终点-This code compiled under IAR compiler to achieve the computer mouse maze, can accurately reach the end
09
- 电脑鼠走迷宫，该算法简单，能实现左转右转45°。快速搜索。-Computer Mouse Maze
Bellman-Ford-algorithm
- 本程序是用C语言来实现Bellman-Ford算法，希望能对别人有帮助!-The program is implemented in C language Bellman-Ford algorithm, hoping to help others!
dayin
- 按凹入表形式横向打印二叉树结构，即二叉树的根在屏幕的最左边，二叉树的左子数在屏幕的下边，二叉树的右子数在屏幕的上边。-By indentations in the form of a horizontal print binary tree structure, that is the root of binary tree on the screen the most left, the left sub-tree the number of the screen below, the rig
《数据结构(C语言版)习题集》答案
- 清华1992年版的数据结构的答案-Tsinghua University in 1992 version of the data structure of the answer
sharePfisher
- 确定投影方向使得降维以后，样本不但线性可分，而且可分性更好-Determine the projection direction makes dimensionality reduction, sample not only linearly separable, and a better separability
data-structure-JAVA-edition-ppt
- 数据结构JAVA版本的电子教案，共有10章。内容全面包括数据结构的基本内容。-Data Structure JAVA version of the electronic lesson plans, a total of 10 chapters. Comprehensive and include the basic content of the data structure.
match
- 三个求二分图最大匹配的程序（bfs，dfs，多增光路算法）-Three for the maximum bipartite graph matching procedure (bfs, dfs, multi-path algorithm Zengguang)
prim
- (1)利用普里姆算法求网的最小生成树 (2)实现教科书中定义的抽象数据类型mfset。以此表示构造生成树过 程中的连通分量。 (3)以文本形式输出生成树中各条边以及他们的权值-(1) the use of prim algorithm for minimum spanning tree network (2) the realization of the textbook definition of abstract data types mfset. Spanning tree s