搜索资源列表
GraphAlgorithm.rar
- C++语言下, 关于图论算法的一些模版, 包括一般图最大匹配, km匹配, 最小割等等, 共15个模版,C++ language under the graph theory algorithm on a number of templates, including the maximum matching in general graph, km matching, minimum cut, etc., a total of 15 templates
aFastAlgorithmforNon-bipartiteMaximalMatching
- 图论相关算法：a fast algorithm for non-bipartite maximal matching-Graph Theory correlation algorithm: a fast algorithm for non-bipartite maximal matching
graphapplicationincompute
- 图论在计算机中的运用,对于程序员来说,设计一个算法,设计模式的必不可少的工具.-Graph theory in computer use, for programmers, to design an algorithm, design patterns indispensable tool.
GraphTheoryAlgorithmAndMATLABcode
- 图论算法和Ｍａｔｌａｂ实现该算法的源代码-Graph theory, algorithms and Matlab source code of the algorithm
1112333
- 量子遗传算法应用于物理频谱分析，结果表明基于量子遗传算法的频谱分配算法性能明显优于颜色敏感图论着色算法-Quantum genetic algorithm is applied to the physical spectrum analysis, the results show that genetic algorithm based on quantum of spectrum allocation algorithm is superior to color-sensitive color
1
- 给定一个有向图，实现图的深度优先, 广度优先遍历算法，拓扑有序序列，并输出相关结果。 功能要求：输入图的基本信息，并建立图存储结构（有相应提示），输出遍历序列，然后进行拓扑排序，并测试该图是否为有向无环图，并输出拓扑序列-Given a directed graph, realize the depth chart first, breadth-first traversal algorithm, topology and orderly sequence, and outputs the
branchandbound
- The basis of branch and bound algorithms is a ranking function. The ranking function assigns a value to each node in the graph. At each step, a branch and bound algorithm uses the ranking function to decide which node to expand next. In contrast, the
gbvs_nips
- 显著性分析论文（英文），三个加州理工教授所写。附带有源码是实验Sample（见英文说明中的下载链接）-Saliency Map Algorithm : MATLAB Source Code Below is MATLAB code which computes a salience/saliency map for an image or image sequence/video (either Graph-Based Visual Saliency (GBVS) or the stand
graph-theory
- 算法中的图论，各种图的算法详解，很值得参考-Algorithm in graph theory, a variety of graph algorithms to explain, it is worth considering
suanfa
- 数据库编程中，各种排序，插入，删除，链表，图的算法实现，及对原来算法的改进算法，希望对你有用-Database programming, various sorting, insert, delete, linked list, graph algorithm and the original algorithm, the improved algorithm, in the hope that useful to you
tu
- 实验要求：（1）理解图顶点和边的存储方法：邻接矩阵和邻接表；（2）理解图的遍历算法，掌握其应用；（3）应用图的遍历算法判断图是否连通和两顶点间是否存在路径。-Experimental requirements: (1) to understand the storage method: Figure the vertices and edges adjacency matrix and adjacency list (2) to understand graph traversal algor
c
- 分形彩图的C或者matlab的源代，可执行的绘制彩色分型算法图形的C或者matlab的源代码，需要3段，也就是3张图。图片尽可能好看-The fractal color of C or matlab source code, executable drawing color genotyping algorithm graph C or matlab source code need 3 paragraphs 3 in Fig. Picture as possible look good
asl
- sample code for aodv algorithm to find out the trace graph
floyd
- 此源码是算法floyd算法的实现,里面有我自己详细解说的几个重点，对于学习图论很有帮助，用于求任意两点间最短路径和路径长度-This source is the realization of the algorithm floyd algorithm, which has my own detailed explanation of several key helpful for learning graph theory, used to find the shortest path betw
seg-ijcv
- This paper addresses the problem of segmenting an image into regions. We de¯ ne a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then develop an e±cient segmentation
Kruska
- 编写算法能够建立带权图，并能够用Kruskal算法求该图的最小生成树。-Write an algorithm that can establish a weighted graph, and the ability to use the Kruskal algorithm for minimum spanning tree of the graph.
graph-theoretic-algorithm
- 关于图论算法的各种问题的matlab代码-Various questions about the graph theoretic algorithm of matlab code
BSTree
- graph algorithm and data structure
graph-and-net
- matab图与网络模型及算法，包括基本理论介绍，例子，和算法程序-matab map and network models and algorithms, including the introduction of basic theory, examples, and algorithm
Parallel-Algorithm
- 基于Spark 分布式图计算模型，提出大规模复杂网络社区并行发现算法DBCS 。-Based on Spark distributed graph computing model, a large scale and complex network community parallel discovery algorithm DBCS is proposed.