搜索资源列表
2007char
- 利用邻接矩阵的图深度优先遍历算法，调试通过，无毒！-use of adjacency matrix plans depth-first search algorithm, through testing, drug-free!
adjlist
- 邻接矩阵转化为邻接表 vc编程基础，学生作业-adjacency matrix into adjacent table vc based programming, students work
redundantpaths
- c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that u
TU
- 图的基本操作，包括查找，遍历，删除，邻接表和邻接矩阵的转换-Fig basic operations, including search, traversal, delete, adjacency list and adjacency matrix conversion
linjiejuzheng
- 邻接矩阵 邻接矩阵（Adjacency Matrix）：是表示顶点之间相邻关系的矩阵。设G=(V,E)是一个图，其中V={v1,v2,…,vn}。-Adjacency matrix adjacency matrix (Adjacency Matrix): is the relationship between the vertex between the adjacent matrix. Let G = (V, E) be a graph, where V = {v1, v2, ..., vn}
Degree_Distribution
- 计算ER网络的节点的度和节点度分布,改进了随机生成邻接矩阵的生成。-Computing degree ER network nodes and node degree distribution, improving the adjacency matrix generate randomly generated.
sds
- 通过一个图的权值矩阵求出它的每两点间的最短路径矩阵。 从图的带权邻接矩阵A=[a(i,j)] n×n开始，递归地进行n次更新，即由矩阵D(0)=A，按一个公式，构造出矩阵D(1)；又用同样地公式由D(1)构造出D(2)；……；最后又用同样的公式由D(n-1)构造出矩阵D(n)。矩阵D(n)的i行j列元素便是i号顶点到j号顶点的最短路径长度，称D(n)为图的距离矩阵，同时还可引入一个后继节点矩阵path来记录两点间的最短路径。-By weight of a graph in which eac
transport
- 上海地铁邻接矩阵表，包含生成程序，输入为每条线线路站台名称～-Shanghai metro adjacency matrix, containing the generated program, enter the site name for each line line ~
zuixiaochengbenliu
- 程序由C语言完成，用Visual Studio 2012编译即可运行。 首先图的格式应为邻接矩阵，程序会提示输入n的大小，然后依次输入节点i，j，以及该节点的容量和成本。容量运费为0可以不用填写。以此类推，直到输入的节点为-1，-1则停止输入。 程序输出最小成本流邻接矩阵和最小成本。-Procedures done by the C language, using Visual Studio 2012 compiler to run. First graph format shoul
Adj
- 图的建立，用邻接矩阵实现的， 包括无向图，有向图-Establishment figure, with the adjacency matrix to achieve, including undirected graph, directed graph
shujujiegou-shangji
- 数据结构上机实验代码，可运行，包括图的遍历，二叉树，邻接矩阵，链表队列等，用于初学者，希望能够帮到你。-Code, data structure, computer experiment can be run, including graph traversal, binary tree, the adjacency matrix, and list the queue, etc., for beginners, the hope can help you.
Assignment-5
- grpah adjacency matrix
c
- 使用c语言采用邻接矩阵实现图的创建，测试已通过，程序简洁-Use c language adjacency matrix diagram to achieve the creation of the test has passed, the procedure is simple
Lin
- 编写程序以邻接矩阵、邻接表两种方式存储指定连通图，并输出存储之后的图。 用深度优先算法和广度优先算法遍历邻接矩阵方式存储的图和邻接表方式存储的图。(The program stores the designated connected graphs in two ways of adjacency matrix and adjacency list, and outputs the graph after storage. Using depth first and breadth firs