资源列表
guandu
- 2、广度优先搜索遍历图的算法：首先访问指定的起始顶点V0，从V0出发，访问V0的所有未被访问过的邻接顶点W1，W2……，Wk,然后再依次从W1，W2……，Wk出发，访问它们的所有未被访问过的邻接顶点，依次类推，直到图中所有未被访问过的邻接顶点都被访问过为止。
FFT
- 快速傅里叶变换子程序FFT-Fast Fourier Transform FFT Subroutine
zhan04
- 栈的链式存储结构和操作实现 ，栈的链式存储结构和操作实现-Chain stack storage structure and operation of the realization of the chain stack storage structure and operation of the realization of
wykobi_utilities
- esim axperner inch grem
airbus23
- first time here, later I will send more-i want to learn from this website, because i just start to learn some programming
ShortestPath
- 从始点v0开始，逐步求v0到其它可达的各顶点的最短路径，直到所有顶点计算完成为止。-Starting from the starting point v0, v0 to other stepwise up to the shortest path to each vertex, until all vertex calculations are completed.
xi-pei
- 洗扑克牌的原理其实与乱数排列是相同的，都是将一组数字（例如1～N）打乱重新排列-Wash cards actually random principle is the same order, are a set of numbers (eg 1 ~ N) upset rearrange
multi
- 利用多线程技术实现快速和冒泡两个排序算法，每个算法一个线程,直观地显示排序算法对输入数据的排序过程。-Using multi-thread technology for fast and bubbling two sorting algorithms, each algorithm is a thread, visual indication of the input data sorting algorithm sorting process.
testZ
- 计算器的功能实现，加减乘除四则运算，三角函数、阶乘、指数运算-Calculator functions to achieve, Math arithmetic, trigonometric functions, factorial, exponentiation
balance-tree
- 平衡树算法的实现，功能为平衡树算法的实现-balance tree
ZNAYU
- Program for search earthquake epicentre
yiqunyouhuasuanfa
- 蚁群算法的优化，以改善传统的蚁群算法不适用欲大规划的TSP问题的解决，缩短搜索的时间。-Ant colony optimization algorithm to improve the traditional ant colony algorithm NA For big plan to solve TSP problem, shorten the time of the search.