资源列表
graphDegree
- 求图的顶点连通度算法。方法就是先对源和汇做枚举，之后对每个枚举情况，把除去源汇两点的其余所有顶点看成是容量限制为1的点，求网络的最大流，就是此点对的顶点连通度，之后对枚举的所有点对找连通度最小的当成图的连通度。 带有顶点容量限制的最大流方法：将带容量限制的顶点u拆成两个点u 和u*，原顶点u的入边为u 的入边，原顶点u的出边为u*的出边，之后在u 和u*之间连接双向边，边的容量为顶点的容量限制。-plans for the vertex connectivity algorithms. F
xsjz
- 你看了就知道是是数据结构的东西你形式啊还不多吗好多了啊。-you know read on the data structure of the things you form ah not a lot more? Ah.
tu_bianli
- 图的建立与多种遍利方法-map and the establishment of a variety of methods !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! good times
list
- 线性表的应用：用顺序表实现求集合的交并差-The application of the linear table: order table with a collection of cross-seeking and achieving poor
Face-Recong-eigen
- Face recognition using eigenfaces
(1)diedai-Otsu-jubu
- 迭代法 OTSU法和局部阈值分割的matlab实现，测试可用-OTSU method, iterative method and local thresholding segmentation matlab implementation, testing available
figure5_35
- 数字图像处理（第二版）第五章例题5.35的实现代码，有关图像几何失真复原。-Digital Image Processing (second edition) Chapter Example 5.35 code, the geometric distortion recovery.
d
- 用于输出哈夫曼树的权值表示和编码编码表示的-For the output of the Huffman tree weights and coding encoding said
daima
- 画桌子和塔 三个视图 可以上下平移 旋转 缩放-Painting table and tower three views translation rotation scaling up and down
2013.10.26_BST
- 生成一颗二叉平衡搜索树，随着输入与删除，同步更新树的结构，使之保持平衡。-Generate a balanced binary search tree, with the input and deleted, synchronized tree structure to keep it balanced.
Untitled1
- 在opengl中使用鼠标点击来画点，可以引申为画圆或者划线-Use the mouse to click in opengl to draw points, can be extended to a circle or dash