搜索资源列表
connect
- 顶点倒塌（Vertex Collapse）算法中，一开始图中的N个顶点看作N个孤立的超顶点(Super Vertex)，算法运行中，有边连通的超顶点相继合并，直到形成最后的整个连通分量。每个顶点属于且仅属于一个超顶点，超顶点中标号最小者称为该超顶点的根。
BFS_CUDA
- 用CUDA实现BFS算法源码。CUDA是NV公司基于GPU的统一计算架构，BFS复杂度由CPU上的O(V+E)降为O(diameter)，直径diameter即图中root到leaf的最长距离。-This is the algorithm of BFS(breadth first search) on CUDA, and its time complexity is down to O(diameter) which diameter means the longest distance bet
Mtrix_minPath
- 求图的任意两点之间最小路径的算法，利用了矩阵乘的原理-Order to map the smallest path between any two points in the algorithm, using the principle of the matrix multiply
three-dimensional-image-registration
- 本文档详细介绍了基于互信息的并行算法的图相配准的研究，应用于大分辨三维图像配准，且配准效率高，稳定。-This document details the parallel algorithm based on mutual information to match prospective study of the map, used in large-resolved three-dimensional image registration, and registration efficient
graph_isomorphism
- 图同构算法的并行实现,把原有的串行算法进行并行加速，大大地提高了效率-Parallel graph isomorphic algorithm, the original serial algorithm for parallel acceleration, greatly improving the efficiency
NodeColoringTabu
- 在matlab下的一种图着色的禁忌算法实现，适合新手使用和学习-In matlab under a taboo graph coloring algorithm, suitable for novices to use and learn
TestCapi
- 并行程序与串行程序的代码，图的并行算法，串行算法。-Parallel MergeSort。
diameter_basic_GraphChi
- 使用GraphChi计算图直径的估值。方法是Magnien 等人提出的 Double Sweep 算法，即两次BFS算法，一次向前一次向后。-Diameter valuation of a Graph using GraphChi framework. Using the method of Double Sweep that Magnien proposed, which is two bfs process.
TriangleCount
- hadoop版本的图的三角计数，比github上分享的方法快很多，没有改进算法，但是根据hadoop的特点用了2个trick:1、编写combiner2、中间键值对压缩。而且多了一轮计算节点度的job,供大家参考-hadoop triangle count, implemented by myself and effctive than that on github.
CGRA_Mapping-master
- 可重构系统的算法映射程序,采用子图同构算法，里面包含40个算法的映射实例-Reconfigurable Systems algorithmic mapping procedures, subgraph isomorphism algorithm, which contains the mapping algorithm instance 40