资源列表
数据结构的稀疏矩阵运算器
- 利用十字链表的储存结构完成距阵的加,减,乘.数据结构实习题目,已完成选做内容.-use the storage structure to complete the matrix, plus or minus, riding. Internship topic data structure, so as to complete the election.
平衡二叉树c++
- 平衡二叉树生成 输入任意个节点 如 2 6 8 0为显示 可自动生成平衡二叉树 bf为平衡因子 h给深度 可插入删除 计算转动次数(wangliwei007也是我,质料没添全就换这个好号,请斑竹给我发个号好吗?我也想下载东西,急)-balanced binary tree generating arbitrary input nodes as 2 6 8 0 to demonstrate that automatically generates balanced binary tree bf f
震铃
- VC下实现响铃的小程序,自动生成一个小文件,可以用realplayer等播放器打开-VC under Neither the small program automatically generates a small file that can be used REALPLAYER other players open
UnionFind
- 这是研究生课程计算方法与技术中讲到的UnionFind算法的具体实现代码。-This is the post-graduate courses and technical calculation method described in UnionFind algorithm to achieve the specific code.
PatternMatching
- 这是计算机专业硕士生课程《算法设计与实现》中讲到的模式匹配算法的实现,并且将该算法与KMP算法进行了比较。-It was the professional degree programs, "Algorithm Design and Implementation" referred to the pattern matching algorithm implementation, and algorithm and KMP algorithm are compared.
三种模式匹配算法的比较
- Las Vegas,KMP,Mentro carlo这三种模式匹配算法的原代码,对其进行了时间及出错率的比较-Las Vegas, KMP, Mentro carlo three pattern matching algorithm of the original code, its time and the error rate comparison
最短路径 迪杰斯特拉
- 最短路径 迪杰斯特拉 最短路径 迪杰斯特拉-Shortest Path Floyd Shortest Path Floyd
数椐结构实验指导书
- 数据结构的实验算法 有线性表的,栈和队列,数组,树和而叉树,图,查找以及排序等算法的源代码 -experimental data structure is linear algorithm to the table, stack and queue, arrays, trees and the trees and fork, graphics, such as search and sorting algorithm source code
smatrix
- 数据库课程设计,用完全链表结构实现稀疏矩阵的创建,删除,以及加、减、乘、转置运算-database curriculum design, fully linked list with sparse matrix structure to achieve the creation, deletion, and, plus or minus, by transfer of home computing
92
- 本代码是用java语言编写的基于决策树c4.5算法的数据挖掘程序,它可以在很多领域如股票系统中使用 -the code is written in java-based Decision Tree Algorithm Bank data mining process, it can in many areas such as the use of the stock system
kruskal最小生成树实现
- 在boost基础上实现 对图的最小生成树实现,通过此算法可以找到此图中连接所有点的最小生成树。-the boost on the basis of the plan to achieve the minimum spanning tree, the algorithm can find this map connect all the points the minimum spanning tree.
最短路径c++语言
- 用从c++写的floyd最短路径算法,可以求邻接矩阵任意两点的最短路径。-from using c + + to write the Floyd shortest path algorithm, can help adjacency matrix arbitrary 2:00 Shortest Path.