资源列表
P2P_Dijkstra
- Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法的Dial实现是通过一系列方法，对Dijkstra算法进行加速。-Dijkstra (Dijkstra) algorithm is a typical single-source shortest path algorithm to compute a node to all other nodes of the s
Power
- Eigen value extraction by Power Method
1316
- URAL_1316_树状数组AC代码 简单的树状数组题目-URAL_1316_ AC code simple tree array array of subject tree
Data-Structures-and-Algorithm-Analysis-In-C---Mar
- Data Structures and Algorithm Analysis in C
BFS
- BFS变度量算法优化，Fortran语言-BFS variable metric algorithm optimization, Fortran language
java
- 根据已知列出分级教学的人数分配和分班教学的人数与及格率的关系，然后设出16个变量，通过传统概率知识列出目标函数，通过约束条件控制变量，建立出一个非线形规划模型，利用计算机程序设计求出最优解-Listed according to the known number of grade teaching assignment and placement of teaching the relationship between numbers and pass rates, and then set o
ACO-P-Tabu
- This refers to ACO which is a meta heuristics and use this in Tabu search algorithm.
Clipmap-2010
- geometry clipmaps的实现算法，目前这方面源码比较少，希望对感兴趣的童鞋有帮助。-the implementation of geometry clipmaps。
The-first-three-arraysaalgorithms
- VB入门项目教学法：第3篇 数组与算法——竞赛评分程序-Getting Started VB Project Approach: The first three arrays and algorithms- competition score program
CUting
- CUDA矩阵乘法和FFT性能测试CUDA matrix multiplication and FFT performance testing-CUDA matrix multiplication and FFT performance testing
ip
- 复合包标记IP追踪算法Composite Packet Marking Algorithm for IP tracking-Composite Packet Marking Algorithm for IP tracking
Distrrithm
- 分布式最小连通支配集启发式算法Distributed Heuristic Algorithm-Distributed Heuristic Algorithm for Minimum Connected Dominating Set