搜索资源列表
hyplas
- ************************************************************************ * * * * * THIS IS THE H Y P L A S 2.0 README FILE * * ----------------- * * * * HYPLAS is a finite element program for implicit small and large * * strain analisys of hyperelast
minspantree
- 最小生成树的克鲁斯卡尔算法 采用邻接矩阵存储图，用树表示和实现集合操作-Kruskal minimum spanning tree algorithm uses the adjacency matrix memory map, with trees and realize that the collection operation
algorithm
- DES算法 DSA算法 ElGamal算法 Kohonen的SOFM(自组织特征映射) LAM（线性联想记忆）算法 LZW 压缩算法 MD5算法 PGP的安全性(一) PKCS #7 RSA算法 SSL是怎样工作的？ Ternary Search Trees 产生组合的非递归算法 大整数的乘法 对LZW算法的改进及其在图象无损压缩中的应用 复数快速傅立叶变换算法 加密算法与密钥管理 经典加密算法在VB中的实现（1）- Rsa
CreatGraph
- 存储图，无论有向图无向图或有向网无向网.可以存储任何类型-Memory map, regardless of the undirected graph or network to network without the
graph
- 图子系统实验，定义了图的存储结构，以及队列操作。包括邻接矩阵，深度优先遍历，以及广度优先遍历-Figure subsystem test, defines the memory structure map and queue operations. Including the adjacency matrix, depth-first traversal and breadth-first traversal
comprsnMapImgs
- Digital maps can best stored and distributed electronically using compressed raster image formats.We introduce as to rage system for the map images that supports compact storage size,decompression of partial image,and smooth transitions between var
DFS
- DFS算法，我自己写的，主要用邻接矩阵存储图-DFS algorithm, I wrote it myself, the main memory map with the adjacency matrix
imagescn
- Imagescn plot two or more imagesc into the same axes. Deeper layers are visible, were higher layers have the value NaN. This is helpful e.g. to show measurement (=foreground) results "above" a map (=background), to separate NaN values within a 2D mat
Studymeterialsfordatastructure
- 数据结构课件（[数据结构(C语言版)].严蔚敏.吴伟民.课件.第04章-串，第05章-数组和广义表，第06章-树和二叉树，第07章-图，第08章-动态存储管理，第09章-查找）-Study meterials for data structure (C language version). Weimin Yan&Weimin Wu . Including: Chapter 04- strings Chapter 05- arrays and generalized list
STL
- 源码之前了无秘密，你将看到vector的实现、list的实现、heap的实现、deque的实现、Red Black tree的实现、hash table的实现、set/map的实现;你将看到各种算法(排序、查找、排列组合、数据移动与复制技术)的实现;你甚至能够看到底层的memory pook和高阶抽象的traits机制的实现。(Before the secret source code, you will see the vector implementation, list implement