搜索资源列表
shortestPath
- 在visual C++上写的动态规划算法在图论中旅行商问题上的应用，适合算法分析的朋友。-In visual C++ to write the dynamic programming algorithm to find the shortest path in the graph the application of suitable algorithms friends.
Plot_a_graph
- Visual Basic code to plot a Graph. It is very simple and easy.
Dijkstra
- 利用Visual C++开发了在图论中的三个有关最短路的经典算法：Warshall、Floyd、Dijkstra，有很好的移植性，使用方便，明了。-Using Visual C++ development in graph theory in three related short-circuit the classic algorithm: of Warshall, Floyd, Dijkstra, good portability, easy to use, clear.
LGME
- input: param: parameters of the LMGE algorithm param.mu, param.alpha, param.beta are regularization parameters. param.p: dimension of shared subspace param.k: number of nearest neighbors for Laplacian matrix X: input data Y: ground
strongly-connected
- 有向图的强连通分量算法的实现，编译、运行及调试环境: Microsoft Visual C-Directed graph strongly connected components algorithm implementation, compiling, running and debugging environment: Microsoft Visual C++
gbvs
- 新的自下而上的视dmits combination with other maps. The model is simple, and biologically plausible insofar as it is naturally parallelized. This model powerfully predicts human xations on 749 variations of 108 natural images, achieving 98% of the ROC area
0721dd41ffc8e3e3ef502fadad265780e9e6
- Designing and Implementing Control Flow Graph for Magic 4th Generation Language