资源列表
MaxFlow_PushRelabeledAlgorithm
- Push&Relabeled algorithm to find the optamal flow on the graph
bin
- 初始链表的内容为：3562，6381，0356，2850，9136，3715，8329，7481，写出用基数排序法对它们进行排序的过程，并编程实现。-The initial list read as follows: 3562,6381,0356,2850,9136,3715,8329,7481, write them using radix sort method to sort the process, and programming.
4
- 此代码为数据结构里三种排序方法，分别为冒泡，插值，选择排序方法-This code is the data structure in the three sorting methods, respectively, bubbling, interpolation, select the sort method
queue
- 队列是一种特殊的线性表，它只允许在表的前端（front）进行删除操作，而在表的后端（rear）进行插入操作。进行插入操作的端称为队尾，进行删除操作的端称为队头。队列中没有元素时，称为空队列。 -Queue is a special kind of linear form, it only allows the front of the table (front) to delete, and in the form of back-end (rear) to insert. The insert
Binary-Tree
- 本程序实现了对二叉树的前、中、后和层序的遍历-The program realization of the binary tree before, during, and after the traversal sequence
maopaofa
- 用冒泡法将一列不规则的数按照从大到小的顺序排列-With the bubble method to a number of irregularly arranged in descending order according to
BPcrossvalind
- MATLAB的BP交叉验证的程序，自己编写的，可直接运行，供大家参考。-MATLAB-BP cross-validation procedure, I have written can be directly run, for your reference.
primfindpath
- Prim算法实现在一个有向图中找一条从一点到另一点的一条路，并不要求是最短路。-Use Prim Algorithm to find a way in a digraph.
2011
- 已知长度最大为200位的正整数n，请求出2011^n的后四位。输入第一行为一个正整数k，代表有k组数据，k<=200接下来的k行， 每行都有一个正整数n，n的位数<=200输出每一个n的结果为一个整数占一行，若不足4位，去除高位多余的0-The known maximum length of 200 positive integer n, requesting the four 2011 ^ n after the. Enter the first acts of a po
tidufa
- 梯度法求解二元二次函数的最优解，通过确定收敛精度、最大迭代次数从而迭代求解。-Gradient Method for optimal binary quadratic function by determining convergence precision, maximum number of iterations so iterative solver
Bidirectional-bubble-sort
- 排序算法之中的........双向起泡算法......可以当做子程序使用-........ Bidirectional bubble sort algorithm among ...... algorithm can be used as subroutines
Partition-tree
- 时代的眼泪-划分树 能在对数时间内求取区间第k大值-Partition tree