搜索资源列表
模拟退火法计算最短路径
- 用模拟退火法高效的计算图论中哈密顿贿赂的最短路径-simulated annealing method of calculating efficient graph theory Hamiltonian bribery Shortest Path
mathmodel
- 这是一个好的建模学习资料,赶快下载吧, 数学建模十大算法 ( 包含:蒙特卡罗算法、数据拟合、参数估计、 插值等数据处理算法、线性规划、整数规划、多元规划、二次规划等规划类问题、 图论算法、动态规划、回溯搜索、分治算法、分支定界等计算机算法、 最优化理论的三大非经典算法：模拟退火法、神经网络、遗传算法、 网格算法和穷举法、一些连续离散化方法、数值分析算法、图象处理算法）-This a good model to study the information, downloa
cellrecognition
- 细胞识别记数系统的实现,全部源代码,包括中心点标记,区域填充,记数等-,Visual C++,图形图象/Graph program -cell identification number system in mind the realization of full source code, including the focal point mark, regional filling, and so mind-, Visual C, graphic images / Graph program
graphyimaseg
- 基于图匹配理论的图像分割，是IJCV上那片经典文献的作者写的程序，简练实用。可以给做这方面的人的参考-based on the theory of graph matching image segmentation, Shangri-La is IJCV on classic literature written by the author of procedures, concise practical. This can be done to the people of reference
zxjd
- 求图中的祖先节点(不含父亲节点) 内含说明，学图论或人工智能的朋友会用到的。希望有利于理解书上的论述。-plans for their ancestral nodes (excluding the father nodes) intron show that studying graph theory in artificial intelligence or a friend will use the. Hope to understand book expositions.
graph
- 基于C语言的图形函数库的源代码 同济大学计算机系 王小平 2000年5月
GA-based-on-the-graph-edge
- 基于遗传算法的有向图的边序列遍历算法Matlab源码.此函数实现遗传算法，用于用于有向图的边遍历序列的优化 GreenSim团队原创作品-Genetic algorithms are based on the edge to the graph traversal algorithm sequence of Matlab source code. This function implements the genetic algorithm used for edge directed graph
gco-v3.0
- graph cut 优化算法的最新版本，包含C++版本（在VS2005以上版本可以调通）和Matlab接口，-graph cut optimization algorithm of the latest version, includes C++ version (or later in the VS2005 can be transferred through) and the Matlab interface
LGE
- LGE算法（Linear Graph Embedding）用于降维，代码比较长，比较复杂。供大家研究！-LGE algorithm (Linear Graph Embedding) for dimensionality reduction, code longer, more complicated. For everyone!
OLPP
- 正交的Linear Graph Embedding算法！用于降维，供大家学习交流。-Orthogonal Linear Graph Embedding Algorithm! For dimensionality reduction for them to learn from the exchange.
Dijkstra
- Dijkstra算法，实现加权有向图中从确定的起点寻找最短路径并输出-Dijkstra algorithm, to achieve a weighted directed graph from the starting point to determine the shortest path to find and output
shortest_path_adjacencyWDigraph
- 采用动态规划法，构建邻接矩阵带权有向图，解决最短路径问题。-Dynamic programming method used to construct adjacency matrix weighted directed graph, the shortest path to solve the problem.
109201262ruby_allocation3
- 算法图论-Algorithm for Graph Theory
GATSP
- 通过此程序能够利用遗传算法解决TSP问题，即图论中从某一点出发经过所有点一次的最短路径求解问题-Through this program can take advantage of genetic algorithm to solve the TSP problem, namely, graph theory starting from a point in time through all the points for solving the shortest path problem
Threetypicalspectralclusteringbasedongraphpartitio
- 三种典型的基于图分割的谱聚类方法比较，模式识别方向相关论文。-Three typical graph-based segmentation of spectral clustering comparison, pattern recognition, the direction of relevant papers.
GraphCut_matlab
- graph cut 优化算法的最新版本，包含和Matlab接口，已编译，以及自己的一个简单测试例子程序MyTest，还有一篇经典论文及自己的读书笔记-graph cut optimization algorithm of the latest version, includes and Matlab interface has been compiled, and their example of a simple test program MyTest, there is a classic
tuzhuode
- 利用模拟退火法解决图着色问题，画出相应的图形，效果较好-Using simulated annealing to solve the graph coloring problem, draw the appropriate graphics, better
yichuan-c-chengxu
- 遗传算法解决图的着色问题，这里面都是源程序，很有用-Genetic algorithms to solve graph coloring problem, this all source code, very useful
Graph-Coloring(HGA)
- 基于遗传算法和禁忌搜索的启发式算法，提供C++代码，能够高效地解决图着色问题。-The code based on the combination of Genetic Algorithm and Tabu Search can be used to solve the Graph Coloring problem efficiently
gated-graph-neural-network-samples-master
- 此代码是门控图神经网络的python代码实现(This code is a Python code implementation of the gating graph neural network)