搜索资源列表
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
11
- 带权图的最短路径问题,主要介绍单源最短路径算法,最短路径问题的提法很多,其它的最短路径问题均可用单源最短路径算法予以解决-Weighted graph shortest path problem, mainly introduce single-source shortest path algorithm, the shortest path problem formulation of a lot of other shortest path problem can be used singl
graphapplicationincompute
- 图论在计算机中的运用,对于程序员来说,设计一个算法,设计模式的必不可少的工具.-Graph theory in computer use, for programmers, to design an algorithm, design patterns indispensable tool.
2007
- 目的与要求: 本设计的目的是通过对死锁检测算法的模拟,来了解死锁检测中的数据结构的设计和使用以及资源分配图在死锁检测中的应用。具体要求如下: ⑴模拟一个死锁检测算法; ⑵该算法能通过简化资源分配图来检测死锁; ⑶资源分配图可以用矩阵的形式表示; ⑷输出结果为有死锁或无死锁。 -Purpose and requirements: The purpose of this design is the deadlock detection algorithm through th
tudebianli
- 这个是图的遍历演示源程序代码,是用c语言写的,大家可以参考一下这个算法-This is a graph traversal demo source code is written in c language, we can refer to this algorithm
BCS
- 压缩传感是一个从2006年左右开始兴起的研究领域,它关注于如何采样信号,也就是信号的采样方式或者压缩方式。通过设计一种特殊的采样方案,可以使得采样频率降低为信号的“信息率”,而不是传统的奈奎斯特采样率,于是,实际的采样率可以大大低于奈奎斯特频率,却只损失很少的信息量,依然保持了充足的信息量足以恢复出采样前的原始信号。这个研究思想挑战了奈奎斯特频率的理论极限,会对整个信号处理领域产生极其深远的影响,同时,信号处理的许多应用领域也会随之发生根本性的发展和变化。 -Compressive sens
SpectralSurfaceReconstructionfromNoisyPointClouds.
- We introduce a noise-resistant algorithm for reconstructing a watertight surface from point cloud data. It forms a Delaunay tetrahedralization, then uses a variant of spectral graph partitioning to decide whether each tetrahedron is inside or out
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
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
graph-theoretic-algorithm
- 关于图论算法的各种问题的matlab代码-Various questions about the graph theoretic algorithm of matlab code
Graph
- 输入一个带权无向图的顶点数、边数、各条边信息(两个顶点和权值),建立该图的邻接矩阵结构,输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构,输出该邻接表;根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列,并输出遍历结果;用prim算法实现构造该带权无向图的最小生成树,并将该最小生成树的各条边信息输出。-Enter a weighted undirected graph with vertices, edges, each of the side information (two ve
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
Bipartite-graph-matching
- 自己的笔记,二分图匹配详解,是用匈牙利算法解的。-Own notes, bipartite graph matching explain, with the Hungarian algorithm solution.
A-Graph-Based-Routing-Algorithm-for-Multi-hop-Cog
- Graph Theory in Cognitive Radio Networks
Parallel-Algorithm
- 基于Spark 分布式图计算模型,提出大规模复杂网络社区并行发现算法DBCS 。-Based on Spark distributed graph computing model, a large scale and complex network community parallel discovery algorithm DBCS is proposed.
Path-finding Algorithm
- 在3D游戏环境中,使用具有2D图层的A *算法执行寻迹或图形遍历。 然而,在3D虚拟环境或空间中,使用2D层的A *算法是有限的。 因此,有必要使用在3D游戏环境中使用3D图层的算法。 这项研究表明,3D A *算法可以比在3D游戏环境中使用2D图像的A *算法更快地配置两个节点之间的路径。(In a 3D game environment, pathfinding or graph traversal is performed using the A* algorithm with 2D l