搜索资源列表
asdfasxa32
- 掌握图的邻接矩阵的存储结构；实现图的两种遍历：深度优先遍历和广度优先遍历。-master plan adjacency matrix storage structure; Implementation plans of the two traverse : depth-first traversal and breadth traversal priority.
tuxingshujujiegou
- 构造一个有向图或无向图，选用一种存储结构，分别输出其深度优先和广度优先的结果。 先按自己的意图画出一个顶点不少于8个、边不少于6条的有向图或无向图，用邻接矩阵或邻接表的存储结构，输入图的顶点信息和边的信息，然后调用深度优先和广度优先搜索算法，看结果是否正确。
3_3
- C语言的数据 解雇偶的变成 关于邻接矩阵-cgcfgfdgdf hdgfh gdf gf
graph
- 用邻接矩阵法建一无向连通图（顶点信息为字符），分别用dfs（深度优先搜索）和bfs(广度优先搜索)遍历，输出图中顶点信息并验证。-Adjacency matrix to build an undirected connected graph (vertex information for characters), respectively dfs (depth-first search), and bfs (breadth-first search) traversal, the output
tu
- 实验要求：（1）理解图顶点和边的存储方法：邻接矩阵和邻接表；（2）理解图的遍历算法，掌握其应用；（3）应用图的遍历算法判断图是否连通和两顶点间是否存在路径。-Experimental requirements: (1) to understand the storage method: Figure the vertices and edges adjacency matrix and adjacency list (2) to understand graph traversal algor
adjacency-matrix-connectivity
- 邻接矩阵连通性的判定，介绍了一种新的图的连通性算法。-The determination of the adjacency matrix connectivity
adjmatrix_graph
- 用邻接矩阵实现图的基本操作：创建，销毁，增删修改顶点，增删弧或边，DFS，BFS等-Graph with adjacency matrix to achieve basic operations: create, destroy, modify vertex deletions, additions and deletions arcs or edges, DFS, BFS, etc.
zui
- 实现最短路径算法的查询功能，邻接矩阵的简单构建，函数方法的调用- Implement query function of the shortest path algorithm, adjacency matrix of simple construction, function method call
PageRank
- 计算网络节点的PageRank得分，前提是邻接矩阵。-This code is used for the calculation of the score of Pagerank.
Floyd
- 使用Floyd算法，根据无向图邻接矩阵，求两点间最短路径-Floyd path