搜索资源列表
residues
- 该文件含残差点数目计算、均方差计算、信噪比计算、边缘等效视数计算-The document containing terms of the number of residues are calculated variance, SNR calculation, calculation of equivalent number of edges
3352
- poj3352给一个图,求出需要加最少的边使去掉任一条边,图都连通.割点的应用-poj3352 to a map, obtained at least the need to remove the edges so that any one side, map are connected. cut-point application
xyk
- 由键盘输入多边形的边数，求其内角和，可以用逐个数字进行试用。-Keyboard input from a number of polygon edges, and its angle and can be used by the figures for trial.
HoughTransformconsole
- Using opencv, Hough Transformation extract lines from edges.
canny
- Canny for find edges in a image. Work fine.
floyd_warshall.c
- It is the source code of the Floyd-Warshall algorithm for finding the shortest path between all nodes. The shortest path between two nodes of a graph is a sequence of connected nodes so that the sum of the edges that inter-connect them is minimal
DijkstraThreads.tar
- Multi Thread Implementation of Dijkstra s Shortest Path Algorithm All-to-all. It reads a file in the format: Edges Nodes start end weight Like this: 20 5 1 2 5 1 3 4 2 1 3 2-Multi Thread Implementation of Dijkstra s Shortest P
Dijkstra
- 可以直接编译运行，输入点和边的信息，给出单源最短路径的结果。-Can directly compile and run, input points and edges information, presented the results of single-source shortest path.
direction
- 2-连通图无边图的边定向算法，使之成强连通图。-2- connectivity diagram boundless edges of the graph orientation algorithm to make it into a strong graph.
rectangularmash
- 对矩形进行小矩形分割，对点，边，单元进行标记，对laplase方程求解-Small rectangle rectangle split points, edges, unit mark of laplase Equations
centrality
- 计算复杂网络中的节点或边的介数中心性，基于python的复杂网络工具箱-Betweenness centrality computational complexity of the network nodes or edges, based on a complex network toolbox python
prims
- Prim s algorithm implementation in C. The input file can be any data file containing edges with their weights
Assignment_Prim.cs.txt
- In computer science, Prim s algorithm is a greedy algorithm that finds a minimum spanning tree for a connected weighted undirected graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight o
gn
- Market Newman写的复杂网络的加权GN算法 算法用Python写的 其基本思想是不断的删除网络中具有相对于所有源节点的最大的边介数(ege betweenness)的边，然后，再重新计算网络中剩余的边的相对于所有源节点的边介数-The basic idea is to delete the network with respect to all of the source nodes of the largest betweenness (EGE betweenness) edge
viewTree
- Graphs visualization with vertices and edges coloring. On C++/Qt
spectalCluster
- 谱聚类是从图论中演化出来的算法，后来在聚类中得到了广泛的应用。它的主要思想是把所有的数据看做空间中的点，这些点之间可以用边连接起来。距离较远的两个点之间的边权重值较低，而距离较近的两个点之间的边权重值较高，通过对所有数据点组成的图进行切图，让切图后不同的子图间边权重和尽可能的低，而子图内的边权重和尽可能的高，从而达到聚类的目的。(Spectral clustering is an algorithm evolved from graph theory, and has been widely u