资源列表
propagation
- Propogarions methos for Wimax
3061
- 北大ACM试题poj 第3061题源码，很好的代码，希望对搞ACM的同学有帮助 -Peking University ACM Chapter 3061 question Question poj source code, good code, and want to help students engage in ACM
so
- 用于对长串数据进行的排序，而且是快速排序，是用的简单的c++实现，c++课程习题解答。建议数据结构和算法课程上课时使用。只是可能太简单了。-Long strings of data used for sorting, but quicksort is used to achieve a simple c++, c++ programs exercises answer. Proposed data structures and algorithms used in class course. J
Sort
- 对数组R中的记录R[1..n]按递增序进行插入排序-Records in the array R R [1 .. n] into the sorted in increasing order to
lscjadiag
- Implementation in R of LSDIC - Joint Diagonalization Algorithm described in "Least square joint diag. of matrices under an intrinsic scale constraint (2009)" by Dinh-Tuan Pham
tree
- 建立一棵二叉树，并对该二叉树进行遍历（分别进行先序、中序、后序遍历。）-The establishment of a binary tree, and traverse the binary tree (respectively the first order, in order, the order of traversal.)
WMM
- 小波神经网络的程序。对于刚开始学习的同学额们很有帮助-Wavelet neural network program. For students just beginning to learn the amount of their useful
erchashubianli
- 二叉树的遍历，适用于VC环境 是一个基本的源代码-just for VC environment
QUICK
- Quick sort using recurssion
EMLMblock
- Analytical Calculation of the Erlang Multi-Rate Loss formula that calculates blocking probabilities in a single link that supports multiple service-classes with diverse QoS requirements
print_all_ancestors
- 对于一颗普通的二叉树和一个节点key，找出该节点的所有祖先节点。-For an ordinary binary tree and a node key, to find all ancestors of this node.