搜索资源列表
graph_layout
- 基于标量场布局算法的图形布局，可以实现数据的可视化-Layout algorithm based on scalar field of graphic layout, data visualization can be achieved
isomap
- In statistics, Isomap is one of several widely used low-dimensional embedding methods, where geodesic distances on a weighted graph are incorporated with the classical scaling (metric multidimensional scaling). Isomap is used for computing a quasi-is
bender
- Source code for the Bender motid detector graph algorithm. Very fast.
graph_coloring
- this algorithm uses genetic algorithm for solve graph coloring problem
Ostergard_A-New-Algorithm-for-the-Maximum-Weight-
- Given a graph, in the maximum clique problem one wants to find the largest number of vertices any two of which are adjacent. In the maximum-weight clique problem, the vertices have weights, and one wants to find a clique with maximum weight. A
algorithm-of-shortest-path
- 介绍了图论中最短路径的floyd最短路算法程序-Describes the shortest path in graph theory, shortest path algorithm program floyd
algorithm-of-xiongyali
- 该文件给出了图论中最短路径的算法程序，其算法使用匈牙利算法-The document gives the shortest path in graph theory algorithm program, the algorithm uses the Hungarian algorithm
-Prims-algorithm
- 通过使用普利姆算法，来实现图中的各种操作。-Through the use of PuLiM algorithm to realize the graph of the various operation.
graph
- This source code for graph generation algorithm testing for same.-This is source code for graph generation algorithm testing for same.
thrust-v0.2RC2.tar
- Thrust Graph Library provides graph container, algorithm, and other concepts like a Boost Graph Library. This Library based on the thrust, which is a CUDA library of parallel algorithms with an interface resembling the C++ Standard Template Library (
Graph-traversal-spanning-tree
- 1．显示图的邻接矩阵, 图的邻接表, 深度优先遍历, 广度优先遍历, 最小生成树PRIM算法, 最小生成树KRUSCAL算法,图的连通分量。 2．当用户选择的功能错误时，系统会输出相应的提示。 3．通过图操作的实现，把一些实际生活中的具体的事物抽象出来-Shown FIG s adjacency matrix, graph the adjlink, depth-first traversal, breadth first traverse, minimum spanning tree m
Arithmetic-Floyd
- Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。-Floyd algorithm, also known as Floyd algorithm, insertion point method is given for finding a weighted graph algorithm shortest path between vertices.
shortest-path-searching-with-A-star-algorithm-in-
- pencarian jalur terpendek pada sebuah graph dengan menggunakan algoritma A* menggunakan visual basic 2008
Graph
- 图的操作，包括1.利用普利姆算法实现最小生成树； 2.利用克鲁斯卡尔算法实现最小生成树； 3.利用迪克斯特拉算法实现最短路径； 4.构建图形；-The chart operation, including 1. the algorithm realizes the smallest spanning tree using Pu Limb 2. algorithm realizes the smallest spanning tree using Crue the
Thinning-algorithm
- 关于图形的细化算法。注意，本程序的细化算法要应用于含线条的黑白二值图像才可以看出细化效果。-Thinning algorithm on the graph. Note that this procedure should be used in the refinement algorithm with binary images of black and white lines can be seen fine results.
graph-search-algorithm
- 图搜索的非启发式和启发式算法, 着重分析了它们各自的复杂性、优缺点及 其相互关系, 提出了改进要点. 这对于如何选用一个合适的搜索算法是十分有益的.-Figure of non-heuristic and heuristic search algorithm, analyzes the complexity of their respective advantages and disadvantages and their relationship, an improved points.
ezbp_v0
- The software for our localized graph cut algorithm is available: B. Peng, L. Zhang, D. Zhang and J. Yang, “Image Segmentation by Iterated Region Merging with Localized Graph Cuts”, to appear in Pattern Recognition
Affinity-algorithm-
- 一遍相当不错的人脸识别亲和力算法论文。对本科生毕业设计非常有用-Again very good affinity for face recognition algorithms papers. Very useful for Graduation
CSharp_LineSegmentSplitter
- An algorithm is proposed to split a single-pixel-width connected line graph into line segments by the Hit-and-Miss transformation (HMT). Firstly, junction points and free end points are detected by a set of HMTs. Then, line segments are traced betwee
Graph-algorithms
- 图论算法，包括弗洛伊德最短路径算法以及最短路径算法，最小生成树算法-Graph algorithms, including shortest path algorithm and the Floyd shortest path algorithm, minimum spanning tree algorithm