搜索资源列表
asdfasxa32
- 掌握图的邻接矩阵的存储结构；实现图的两种遍历：深度优先遍历和广度优先遍历。-master plan adjacency matrix storage structure; Implementation plans of the two traverse : depth-first traversal and breadth traversal priority.
AdjacencylistgraphadjacencymatrixtoestablishtheDat
- 图邻接矩阵 邻接表的建立c++_数据结构课程设计-Adjacency list graph adjacency matrix to establish the c++ Data Structure Course Design
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
neighbours-nodistance
- 输入矩阵及其阶数，通过求该矩阵德尔邻接矩阵求无向图。-The order of the input matrix and by request of the matrix Del undirected graph adjacency matrix.
tudebianliguochegn
- 图邻接矩阵_邻接表的建立 图的遍历课程设计-_ Adjacency list graph adjacency matrix graph traversal establishment of curriculum design
program
- The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then ra
bchsabdcbdb
- The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then ra
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
guanjianlujingwenti-
- 用拓扑排序、邻接矩阵存储 结构建图、for语句的灵活运用，栈及数组来实现最短路径问题-Topological sorting adjacency matrix storage structure building plans, the flexible use of the for statement, stacks and arrays to achieve the shortest path problem
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.
Graph
- 输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用prim算法实现构造该带权无向图的最小生成树，并将该最小生成树的各条边信息输出。-Enter a weighted undirected graph with vertices, edges, each of the side information (two ve
zui
- 实现最短路径算法的查询功能，邻接矩阵的简单构建，函数方法的调用- Implement query function of the shortest path algorithm, adjacency matrix of simple construction, function method call
ExamCpp--
- 单链表，单循环链表，双链表，循环双链表的实现，二叉树的遍历与实现。森林与树的转换以及图的深度广度遍历，邻接矩阵邻接表实现-Single list, round robin list, double-linked list, circular double-linked list implementation, and implementation of a binary tree traversal. Forest conversion, and the depth and breadth of
Kruskal
- This an implementation of Kruskal s Algorithm using adjacency matrix.
Prim
- This is an implementation of Prim s Algorithm using adjacency matrix.
warshall
- Warshall算法，自己输入图的邻接矩阵，自动判断图是否连通-Warshall algorithm, own input adjacency matrix, automatically determine whether the connectivity map
BFS-ADJ-LIST-MAZE
- Breadth-first search (BFS) using adjacency matrix
加强图
- 图 深度优先搜索遍历和 邻接矩阵，闫蔚敏版，简单易懂，适合平时交作业(Graph depth first search and adjacency matrix, Yan Yumin version, simple, suitable for everyday homework)
图的深度和广度搜索
- 关于图的邻接矩阵的建立和广度和深度遍历结果显示(The establishment of the adjacency matrix of a graph and the result of the breadth and depth traversal)