搜索资源列表
5
- 无向带权图的建立,建立其邻接矩阵并实现其广度遍历-Undirected weighted graph of the establishment, the establishment of its adjacency matrix and to achieve its breadth traversal
graph_
- //有向图:有向图,无向图基本操作 //运行环境：VC //有向图,无向图基本操作,包括: //1、邻接矩阵 //2、邻接表 //3、深度优先遍历 //4、广度优先遍历 //5、最小生成树 //6、拓扑排序 //7、每一对顶点之间的最短路径（Dijkstra,Floyd两种算法）-//Directed graph: directed graph, undirected graph basic operation// Operating Environme
linkgragh
- 图的邻接表存储的所有功能实现在vC下调试通过-Graph adjacency list all the features of the realization of storage in vC debugging through
juzheng
- 图的邻接矩阵存储（数组表示）、简单输出。-Graph adjacency matrix storage (array, said), a simple output.
yuio
- * 函数功能: 深度优先遍历邻接链表表示的图 * 输入参数: Graph_A G 邻接链表表示的图 -* Function: depth-first traversal of the graph adjacency list that* input parameters: Graph_A G said adjacency list of graph
sorting
- 数据结构课程设计_拓扑排序 用邻接表构造图 然后进行拓扑排序 -Data Structure Course Design _ topological sort graph using adjacency list structure and then proceed to topological sorting
youxiangtuopupaixu.txt
- 有向图的拓扑排序 通过邻接链表 排序-Directed graph topological sort to sort through the adjacency list
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
ShortestPathsEdge
- In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights of the edges and the number of edges. For example: if two paths with equal cost exist then, the path with the least number of edges is chosen as the sh
wxtbl
- 利用邻接表存储无向图,并深度遍历和广度遍历图-Use adjacency list stored undirected graph, and the depth and breadth traversal graph traversal
tudebianli
- 图的遍历和生成树求解实现（邻接矩阵、邻接表 ―图的深度广度遍历算法的实现和最小生成树PRIM和KRUSCAL算法的实现） -Graph Traversal and Spanning Tree Solution implementation (adjacency matrix, adjacency list- map the depth of breadth traversal algorithm and implementation of the minimum spanning tree al
Adjacencylisttraversal
- 遍历邻接表以及执行邻接矩阵布尔调整是数据结构里图的经典算法。- Traverse the adjacent table and adjust the implementation of Boolean adjacency matrix data structure is a classic graph algorithm.
Dijkstra
- 该问题为单元最短路经问题，求出一个有向图中两点之间权值最小的路径。 Dijkstra算法要求有向图中没有权值为负的边，有向图的信息由一个邻接表来表示，另外对每个顶点都设置一个属性d[v]，描述从源点到v的最短路经上权值的上界。算法中设置一个顶点集合S，反复选择具有最短路经估计的顶点u∈V-S,并将u加入S中，算法中还用到了顶点的最小优先队列，排序关键字为顶点的d值。-The issue of the shortest path problem as a unit, find a directed
disanti
- (1)自选存储结构，输入含n个顶点（用字符表示顶点名称）和e条边的图G； (2)指定任意顶点x为初始顶点，对图G作DFS遍历，输出DFS（深度优先）顶点序列(提示:使用栈实现DFS)； (3)指定任意顶点x为初始顶点，对图G作BFS（广度遍历），输出BFS顶点序列(提示:使用队列实现BFS)； (5)输入顶点x，查找图G:若存在含x的顶点，则删除该结点及与之相关连的边，并作DFS遍历(执行操作3)；否则输出信息“不存在x”； (6)判断图G是否是连通图，输出信息“YES”/“NO
c41
- 多段图用邻接矩阵存储，编写多段图问题的向后递推动态规划算法。-Multi-stage graph with adjacency matrix storage, the question of the preparation of multi-stage plan backward recursive dynamic programming algorithm.
6.7.1
- 图的深度和广度优先搜索 1.图采用邻接表的存储结构 2.深度优先搜索图 3.广度优先搜索图-1. Graph using adjacency list of the storage structure 2. Depth-first search Figure 3. Breadth-first search graph
TopoSort
- 实现拓扑排序：一个有向无环图，表述为一个邻接矩阵graph[n][n]，其中graph[i][0]为顶点i的入度，其余为其后继结点。-The realization of topological sort: a directed acyclic graph, expressed as an adjacency matrix graph [n] [n], which graph [i] [0] for the vertex i of income, the remaining node to it
shixiantudebianli
- MatToList(MGraph g,ALGraph *&G)：将邻接矩阵g转换成邻接表G。 ListToMat(ALGraph *G,MGraph &g)：将邻接表G转换成邻接矩阵g。 DispMat(MGraph g)：输出邻接矩阵g。 DispAdj(ALGraph *G)：输出邻接表G。 DFS(ALGraph *G,int v)：以递归的方法从顶点v深度优先遍历图G。 =
AdjacencylistgraphadjacencymatrixtoestablishtheDat
- 图邻接矩阵 邻接表的建立c++_数据结构课程设计-Adjacency list graph adjacency matrix to establish the c++ Data Structure Course Design
bai
- 用C++编写的用邻接矩阵来创建无向图，并求每个点的度。-Adjacency matrix with the creation of undirected graph, and for degrees.