Search - graph - CodeBus

Search - graph - List

[AI-NN-PR] simulated annealing DL : 1: 模拟退火算法求解经典图论中的图着色问题的源程序-simulated annealing algorithm classic graph coloring map of the source
Date : 2026-01-01 Size : 3kb User : 黄大东
[AI-NN-PR] 模拟退火法计算最短路径 DL : 0: 用模拟退火法高效的计算图论中哈密顿贿赂的最短路径-simulated annealing method of calculating efficient graph theory Hamiltonian bribery Shortest Path
Date : 2026-01-01 Size : 2kb User : 孙兵
[AI-NN-PR] graphyimaseg DL : 0: 基于图匹配理论的图像分割，是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
Date : 2026-01-01 Size : 8kb User :
[AI-NN-PR] cheap DL : 0: 图论经典问题——哈密尔顿回路的便宜算法的实现-Classic problems in graph theory- Hamilton loop cheap Algorithm
Date : 2026-01-01 Size : 1kb User : Wtomly
[AI-NN-PR] ACO DL : 0: 蚁群优化算法是一种基于自然启发的metaheuristic算法,从其提出到现在历经10多年的发展到目前已经成为一种解决组合优化问题的有效工具。最大团问题是一个经典的NP难的组合优化问题,很多实际问题都可以抽象为对无向图上最大团问题的求解,所以,对最大团问题的研究无论在理论上还是实际上都有重要意义。 -Ant colony optimization algorithm is a metaheuristic based on natural-inspired algorithms, from their proposed up to now after 10 years of development to the present has become a kind of combinatorial optimization problems to solve an effective tool. Maximum Clique problem is a classic NP hard combinatorial optimization problem, a lot of practical problems can be abstracted as undirected graph of the largest corporations to solve the problem, therefore, the largest corporation on the issue of research both in theory and in fact have a major significance.
Date : 2026-01-01 Size : 231kb User : wangliang
[AI-NN-PR] Dominantset DL : 1: 一种较新的聚类算法 Dominant-set 的代码，包括聚类算法的代码和测试代码。该算法最大特点就是基于图理论的，相对于Normalized Cut,计算复杂度低很多，况且能自动决定类的个数 -A relatively new clustering algorithm Dominant-set the code, including the clustering algorithm code and test code. Most prominent feature of the algorithm is based on graph theory, and compared with the Normalized Cut, much lower computational complexity, decision Moreover automatically the number of categories
Date : 2026-01-01 Size : 3kb User : 曾祥林
[AI-NN-PR] GP DL : 0: PSO算法实现的图分割问题的matlab源码。原创-PSO algorithm for the graph partitioning problem matlab source. Original
Date : 2026-01-01 Size : 23kb User : chn
[AI-NN-PR] TSp DL : 0: cost存放了一个强连通图的边权矩阵，作为一个实例。可在workspace中加载运用此算法要注意多次试验。 bianquan.m文件给出了一个参数实例，可在命令窗口中输入bianquan,得到邻接矩阵C和节点个数N以及一个任意给出的路径R,，回车后再输入jiaohuan3,得到了最优解。由于没有经过大量的实验，又是近似算法，对于网络比较复杂的情况，可以尝试多运行几次jiaohuan3,看是否能到进一步的优化结果。-storage cost of a strongly connected graph edge weight matrix, as an example. Can be loaded in the workspace to use this algorithm to the attention of numerous tests. bianquan.m document gives examples of a parameter can be in the command window, type bianquan, be the adjacency matrix C and the node number N and an arbitrary given path R,, carriage return after the input jiaohuan3, have been the optimal solution . After the absence of a large number of experiments, it is approximate algorithm, for more complex network situations, you can try to run several jiaohuan3, can look to further optimize the results.
Date : 2026-01-01 Size : 11kb User : 岳明
[AI-NN-PR] simulate_anneal DL : 0: 用mathlab编写的经典的模拟退火应用程序，包括图着色问题，最大截问题等-Mathlab prepared to use the classic simulated annealing applications, including graph coloring problem, the largest cut-off problems
Date : 2026-01-01 Size : 15kb User : xianyan
[AI-NN-PR] LGE DL : 0: LGE算法（Linear Graph Embedding）用于降维，代码比较长，比较复杂。供大家研究！-LGE algorithm (Linear Graph Embedding) for dimensionality reduction, code longer, more complicated. For everyone!
Date : 2026-01-01 Size : 3kb User : 小哈
[AI-NN-PR] OLPP DL : 0: 正交的Linear Graph Embedding算法！用于降维，供大家学习交流。-Orthogonal Linear Graph Embedding Algorithm! For dimensionality reduction for them to learn from the exchange.
Date : 2026-01-01 Size : 2kb User : 小哈
[AI-NN-PR] Dijkstra DL : 0: Dijkstra算法，实现加权有向图中从确定的起点寻找最短路径并输出-Dijkstra algorithm, to achieve a weighted directed graph from the starting point to determine the shortest path to find and output
Date : 2026-01-01 Size : 176kb User : 曹雷
[AI-NN-PR] shortest_path_adjacencyWDigraph DL : 0: 采用动态规划法，构建邻接矩阵带权有向图，解决最短路径问题。-Dynamic programming method used to construct adjacency matrix weighted directed graph, the shortest path to solve the problem.
Date : 2026-01-01 Size : 1.93mb User : 柳春锋
[AI-NN-PR] 109201262ruby_allocation3 DL : 0: 算法图论-Algorithm for Graph Theory
Date : 2026-01-01 Size : 17kb User : 陈燕
[AI-NN-PR] GATSP DL : 0: 通过此程序能够利用遗传算法解决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
Date : 2026-01-01 Size : 4kb User : luoyong
[AI-NN-PR] Threetypicalspectralclusteringbasedongraphpartitio DL : 0: 三种典型的基于图分割的谱聚类方法比较，模式识别方向相关论文。-Three typical graph-based segmentation of spectral clustering comparison, pattern recognition, the direction of relevant papers.
Date : 2026-01-01 Size : 1.04mb User : 刘毅
[AI-NN-PR] gco-v3.0 DL : 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
Date : 2026-01-01 Size : 66kb User : tanghuang
[AI-NN-PR] GraphCut_matlab DL : 0: 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 paper and his reading notes
Date : 2026-01-01 Size : 46kb User : tanghuang
[AI-NN-PR] tuzhuode DL : 0: 利用模拟退火法解决图着色问题，画出相应的图形，效果较好-Using simulated annealing to solve the graph coloring problem, draw the appropriate graphics, better
Date : 2026-01-01 Size : 2kb User : 宋聃
[AI-NN-PR] GA-based-on-the-graph-edge DL : 0: 基于遗传算法的有向图的边序列遍历算法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 traversal sequence optimization GreenSim original works team
Date : 2026-01-01 Size : 1kb User : lzf

« 12 3 4 5 6 7 »