搜索资源列表
图数据结构操作方法
- C++实现了图的邻接矩阵、插入、删除节点,删除边等操作
dongtaiguihua.rar
- 用动态规划求解最短路问题的MATLAB程序。需输入带权邻接矩阵,输出为最短路径和最短路长。,Dynamic Shortest Path Problem Solver of the MATLAB program. Required to enter the weighted adjacency matrix, the output for the shortest path and shortest path length.
PBFSandDFS
- 对与数据结构中有向图采用邻接矩阵为存储结构实现有向图建立、深度优先遍历和广度优先遍历、并带有图片测试数据 可运行-And the data structure of a directed graph with adjacency matrix storage structure established to achieve a directed graph, depth-first traversal and breadth-first traversal, and test data can
incandadf
- 实现关联矩阵与邻接矩阵相互转化的matlab代码-Correlation matrix and adjacency matrix to achieve mutual transformation of matlab code
shujujiegou
- 对任意给定的图(顶点数不小于20,边数不少于30,图的类型可以是有向图、无向图、有向网、无向网),能够输入图的顶点和边(或弧)的信息,并存储到相应存储结构(邻接矩阵、邻接表、十字链表、邻接多重表,任选其中两种类型),对自己所创建的图完成以下操作: -For any given map (not less than 20 vertices, edges not less than 30, the type of map can be a directed graph, undirected g
Adjacency-matrix
- 利用邻接矩阵实现图的遍历,C++源代码,能通过编译。-Using adjacency matrix of graphs can traverse, c++ source code, can to compile.
Clustering_Coefficient
- 根据邻接矩阵计算网络的聚类系数。输入为邻接矩阵输出为整个网络的聚类系数-cluster coefficient
Clustering_Coefficient
- 根据邻接矩阵,计算复杂网络中模块的聚类系数。-According to the adjacency matrix, the computational complexity of the network module clustering coefficients.
ISM
- ISM 解释型结构模型 根据邻接矩阵求可达矩阵,进行级划分的算法-ISM model to explain structure up under the adjacency matrix matrix, the class division algorithm
图基本操作
- 介绍了图的C++基本操作,建立,遍历,两种遍历方法,采用邻接矩阵建立图
topnology
- MATLAB做网络优化,先生成一个随机的邻接矩阵,然后画出改图。-MATLAB to do network optimization, sir into a random adjacency matrix, and then draw the reform plan.
KM
- 二分图最佳匹配算法,使用KM算法的邻接矩阵的实现-Bipartite graph matching algorithm is the best use of KM implementation of the adjacency matrix algorithm
612109301
- 要求采用邻接矩阵作为无向图的存储结构,邻接表作为有向图的存储结构,完成无向图和有向图的建立,并对建立好的图进行深度和广度优先遍历。具体实现要求: 1. 通过键盘输入图的顶点和边信息,分别构造一个无向图的邻接矩阵和一个有向图的邻接表。 2. 分别对建立好的两个图进行深度和广度优先遍历,输出相应的遍历序列。 3. 统计两个图的连通分量的个数。 -Require the use of adjacency matrix as the storage structure of an und
Desktop
- 弗洛伊德算法最短距离的实现,输入为邻接矩阵,输出为最短距离矩阵。-Freud' s realization of the algorithm for the shortest distance, enter the adjacency matrix output for the shortest distance matrix.
Floyd
- floyd算法的c++实现,通过输入邻接矩阵,求出点到点的最短距离,测试通过。附带说明-floyd algorithm c++ achieve by entering the adjacent matrix, find the shortest distance of the point-to-point, the test is passed. Annotated
TDJB
- 1)自选存储结构,输入含n个顶点(用字符表示顶点)和e 条边的图G; (2)求每个顶点的度,输出结果; (3)指定任意顶点x为初始顶点,对图G作DFS遍历,输出DFS 顶点序列(提示:使用一个栈实现DFS); (4)指定任意顶点x为初始顶点,对图G作BFS遍历,输出BFS 顶点序列(提示:使用一个队列实现BFS); (5)输入顶点x,查找图G:若存在含x的顶点,则删除该结点及 与之相关连的边,并作DFS遍历(执行操作3);否则输出信 息“无x”;
graphlinjiejuzhen
- 用C++的模板类实现了图的邻接矩阵数据结构,下载后添加头文件即可使用。-Adjacency matrix data structure use C++ template classes, and add header files to download.
depth-first-algorithm
- 数据结构经典算法C++实现(五):深度优先(邻接矩阵,递归)算法-Data structures classical algorithm C++ of realization (e): depth-first (recursive) algorithm, the adjacency matrix
DFSfunction
- DFS非递归函数 函数功能:图的dfs的非递归算法(用堆栈实现) 输入:图的邻接矩阵 输出:dfs序列 -DFS non-recursive function function function: dfs map non-recursive algorithm (using the stack to achieve) Input: adjacency matrix graph output: dfs sequence