资源列表
Matrix-Inverse--source-code-_-1
- 矩阵求逆运算。fortran代码。供初学者参考-Matrix inversion. fortran code. Reference for beginners
清华版数据结构笔记
- 清华版数据结构笔记-Tsinghua notebook version of the data structure
Matrix-Inverse-_fortran-source-code
- 矩阵求逆运算。fortran代码。供初学者参考-Matrix inversion. fortran code. Reference for beginners
VIPS
- 用C++实现对普通网页文件的内容收取，以及按标签分类，为是VIPS算法做数据预处理，并以颜色和字体大小为属性-C++, to achieve the contents of ordinary web document collection, and by label classification, as is the VIPS algorithm to do data preprocessing, and to color and font size for the properties
612109301
- 要求采用邻接矩阵作为无向图的存储结构，邻接表作为有向图的存储结构，完成无向图和有向图的建立，并对建立好的图进行深度和广度优先遍历。具体实现要求： 1. 通过键盘输入图的顶点和边信息，分别构造一个无向图的邻接矩阵和一个有向图的邻接表。 2. 分别对建立好的两个图进行深度和广度优先遍历，输出相应的遍历序列。 3. 统计两个图的连通分量的个数。 -Require the use of adjacency matrix as the storage structure of an und
b+
- 我们程序设计课上要求写的b+树的c++实现，可以进行插入查找删除等操作，代码简单，适合新手-We design classes require written b+ Tree c++ Achieve, can be inserted to find the deletion of such operations, the code is simple, suitable for novice
B_PLUS
- B+树的实现，包括建立，删除、插入等，已经过测试-B+ tree implementation, including create, delete, insert, etc., have been tested
word-counting
- 统计文章中每一个单词出现次数的程序，是C语言中字符串处理的经典教学例子-Article statistics the number of occurrences of each word in the process, the C language teaching in a classic example of string handling
hitag2
- Hitag2算法的C语言程序。验证通过。可运行于VC-// Software optimized 48-bit Philips/NXP Mifare Hitag2 PCF7936/46/47/52 stream cipher algorithm by I.C. Wiener 2006-2007. // For educational purposes only. // No warranties or guarantees of any kind. // This code is r
graph
- 图论的算法，最短路，最小生成树，连通，匹配，网络流及应用。-Graph theory, algorithms, shortest path, minimum spanning tree, connectivity, matching, network flow and applications.
multiplynewsextraction
- 新闻内容页的多要素信息抽取算法，包括标题、作者、正文、时间、来源等要素的抽取-Many elements of news content page information extraction algorithms, including title, author, text, time, source, extraction of elements such as
al
- 算法分析书，涵盖了动态规划等经典算法，很实用-Algorithm analysis of the book, covering classics such as dynamic programming algorithm, it is useful