搜索资源列表
linjiejuzhen
- 能够输入输出一个图的邻接矩阵，能够对相应的边和顶点进行插入删除操作，能够进行深度和广度优先搜索遍历-The adjacency matrix of a graph can be input and output, insertion and deletion operations to the corresponding edges and vertices, depth and breadth-first search traversal
clustering_coefficients
- 关于复杂网络的聚类系数算法，用matlab计算，矩阵为稀疏矩阵。-clustering_coefficients(A) returns the clustering coefficients for all vertices in A. The clustering coefficient is the ratio of the number of edges between a vertex s neighbors to the total possible number of edges
EdgeOfGraph-SequenceTraversalAlgo
- To the edges of the graph sequence traversal algorithm based on genetic algorithm Matlab source
4
- MATLAB的图像处理基础的资料\4 程序代码说明 P0401：用Prewitt算子检测图像的边缘 P0402：用不同σ值的LoG算子检测图像的边缘 P0403：用Canny算子检测图像的边缘 P0404：图像的阈值分割 P0405：用水线阈值法分割图像 P0406：对矩阵进行四叉树分解 P0407：将图像分为文字和非文字的两个类别 P0408：形态学梯度检测二值图像的边缘 P0409：形态学实例——从
graph_sman
- These four files are intended for addingdeleting nodes and edges in biograph object
axy2ve
- Convert Graph of Adjacency Matrix and XY Points to Vertices and Edges
Hyper
- converts a binary undirected adjacency graph into a hypergraph. The output is a non symmetric matrix where the columns are the vertices and the rows are the hyper edges.
ve2axy
- Convert Graph of Vertices and Edges to Adjacency Matrix and XY Points
ACA_QoS_MR
- ACA_QoS_MR时蚁群算法在组播路由中的应用，输出最优组播树（01邻接矩阵表示）,最优组播树所有的边,最优组播树的费用-ACA_QoS_MR ant colony algorithm for multicast routing output optimal multicast tree (01 adjacency matrix), all the edges of the optimal multicast tree, the optimal multicast tree cost
rectangularmash
- 对矩形进行小矩形分割，对点，边，单元进行标记，对laplase方程求解-Small rectangle rectangle split points, edges, unit mark of laplase Equations
kuan
- This code consists of the kuan filter, which is being used to filter the image by consolving its edges and reduces the speckle noise.
mapcoloring
- 已知中国地图,对各省进行着色,要求相邻省所使用的颜色不同,并保证使用的颜色总数最少。地图采用数据结构中无向图的存储结构存储，中国的三十四个省为三十四个节点，若两省相邻则存在一条边。任选一个节点作为初始节点开始着色，与其不相邻的边涂为相同颜色，然后再未涂色的节点中任选一节点重复上述步骤，直到所有节点均涂上色为止。-Known map of China, the provinces colored neighboring Province, the colors used, and to ensu
connected-components
- 此代码是基于数据结构算法分析的代码，用到图论中的深度优先收索法来求连通分支的问题，只要给出顶点、边数和相应的边就可以求出连通分支的数目-This code is based on the analysis of the code of the data structure algorithms used in graph theory depth-first closing cable method, as long as the given vertex connectivity of the
contours
- The Canny edge detector is an edge detection operator that uses a multi-stage algorithm to detect a wide range of edges in images
AddEgesEM
- 通过优化算法从可选边集中选择合适的边的组合添加到网络中，以提高网络的抗毁性。-By optimizing algorithm concentrate from the optional side choose the right combination of edges added to the network to improve network survivability.
GCP
- 着色问题，是最著名的NP-完全问题之一。 给定一个无向图G＝（V, E），其中V为顶点集合，E为边集合，图着色问题即为将V分为K个颜色组，每个组形成一个独立集，即其中没有相邻的顶点。其优化版本是希望获得最小的K值。-Coloring problem, is the most famous NP-complete problems. Given an undirected graph G = (V, E), where V is the set of vertices, E is the se
UndirectedGraph
- 遍历一遍，判断图分为几部分（假定为P部分，即图有 P 个连通分量）,对于每一个连通分量，如果无环则只能是树，即：边数＝结点数－1,只要有一个满足边数>结点数－1,原图就有环. -Traverse again, the determination map is divided into several parts (assumed to section P, with P in Figure connected component), for each connected compone
101---Domino
- SGU 101 Domino 题解 能否找一条欧拉路将所有边走一遍，输出路径-SGU 101 Domino problem solution will be able to find an Euler path all the edges go again, the output path
adjlist.c
- it is easier to work with a graph which is in adjacency list format: a list of vectors each vector contains the neighbor vertices or incident edges of a given vertex. -it is easier to work with a graph which is in adjacency list format: a list of vec
graph
- 输入多条边(村庄之间的道路)依附的顶点(村庄)及权值(路径长度），然后找到两个村庄之间的最短路径-Enter the number of edges (the road between the villages) attachment vertices (villages) and weights (path length), and then find the shortest path between two villages