搜索资源列表
bianli
- 用邻接矩阵确定图 输出深度优先遍历和广度优先遍历的结果-Map with the adjacency matrix to determine the depth first traversal and breadth of the output first traversal of the results
floyd
- 利用输入邻接矩阵来求取2点之间的最短路径-Adjacency matrix to compute using the input the shortest path between 2 points
tudebianli
- 建立图的存储结构（图的类型可以是有向图、无向图、有向网、无向网，学生可以任选两种类型），能够输入图的顶点和边的信息，并存储到相应存储结构中，而后输出图的邻接矩阵。-Establishment of the storage structure map (map type can be a directed graph, undirected graph, directed networks, undirected networks, students may choose one of two
Graph
- 运用单链表和邻接矩阵实现图的表示、图的运算以及图的遍历-Used to achieve a single list and adjacency matrix graph representation, graph operations and graph traversal
Final_v2
- SpectralClustering performs one of three spectral clustering algorithms (Unnormalized, Shi & Malik, Jordan & Weiss) on a given adjacency matrix. SimGraph creates such a matrix out of a given set of data and a given distance function. The code ha
_
- 图运算 在邻接矩阵存储结构上实现图的深度和广度优先遍历算法-Figure computing adjacency matrix storage structure diagram of the depth and breadth-first traversal algorithm
wangluotuopu
- 功能是将邻接矩阵或关联矩阵变为有向或者无向网络图，有结果显示。-Function is to convert the adjacency matrix or the correlation matrix becomes directed or undirected network diagram, results show.
Degree_Distribution
- 已知邻接矩阵求无向网络图度分布的MATLAB程序。-MATLAB program known distribution of the adjacency matrix
nauty20
- Nauty 图同构算法 用于比较两个邻接矩阵表示的拓扑图是否拓扑相似。版本为nauty 2.0b 。可以将图转换为唯一的序列串。-Nauty isomorphism algorithm is used to compare two whether topology adjacency matrix topology similar. Version nauty 2.0b. The map can be converted to a unique serial string.
CREAT_LINJIE_MATRIX
- 根据线路参数里的起始节点和终止节点编号确定无向图的邻接矩阵及测试案例(The adjacency matrix of the undirected graph is determined according to the start node and the termination node number in the line parameter)
liantong_numofblocks
- 根据图的邻接矩阵判断图的连通性并计算图的分块数(To determine the connectivity of the graph and computing graph blocks according to the adjacency matrix)