搜索资源列表
Graph
- 介绍了邻接表和邻接矩阵的转换，对于很多刚学习数据结构的人来说，很有用-Describes the adjacency list and adjacency matrix conversion, just to learn the data structure for many people, very useful
graph
- 实现图的存储结构---实现无权邻接矩阵和有权邻接矩阵的设置和输出-Implement plans to achieve the storage structure--- right adjacency matrix and adjacency matrix of the right to set and output
Graph
- 运用单链表和邻接矩阵实现图的表示、图的运算以及图的遍历-Used to achieve a single list and adjacency matrix graph representation, graph operations and graph traversal
Graph
- 有关图的各种重要的操作，有图的邻接矩阵存储，链表存储，关键路径，最短路径，平衡二叉树等-The plan of the various important operation, has the adjacency matrix storage memory list, critical path, shortest path, balanced binary tree, etc.
graph(linjiejuzhen)
- 基于C++模板，用邻接矩阵的方式，实现了基本的Graph(map)的构建，并实现了深度优先搜索和广度优先搜索，同时加入了测试用的数据读入和写入函数，便于调试和在本代码基础上进行进一步扩充。-Based on C++ templates, adjacency matrix, enabling a basic Graph (map) to build and achieve a depth-first search and breadth-first search, also joined the
adjacency-table-to-stor
- 用c语言来实现邻接表存储有向图，计算顶点的出度和入度-C language to implement a directed graph adjacency table to store, calculate the out-degree and vertex-degree
The-graph-traversing-algorithm
- 以邻接矩阵或邻接表为存储结构，以用户指定的顶点为起始点，实现无向连通图的深度优先及广度优先搜索遍历，并输出遍历的结点序列-The adjacency matrix or adjacency list for the storage structure to user-specified vertex as a starting point to achieve a connected undirected graph of the depth-first and breadth-first se
using-adjacent-matrix-to-store-graph
- 用C语言数据结构描述的演示用邻接矩阵存图的小程序-Described in C language data structures stored adjacency matrix of graph presentation with a small program
database-Graph
- 一：实验目的： （1）掌握图的存储思想及其存储实现。 （2）掌握图的深度、广度优先遍历算法思想及其程序实现。 （3）掌握图的常见应用算法的思想及其程序实现。 （4）理解有向无环图、最短路径等算法 二：实验内容： 以下实验内容，1和2为必做内容，3为选做内容。 1.有向图 （1）键盘输入数据，建立一个有向图的邻接表，并输出该邻接表。 （2）在有向图的邻接表的基础上计算各顶点的度，并输出。 （3）以有向图的邻接表为基础实现并输出它的拓扑排序序
Graph
- 邻接矩阵的建立，赋值和输出所建立 的矩阵-The establishment of the adjacency matrix, assignment and the output of a matrix
Graph
- 使用邻接表作为存储结构构造图，并完成图的建立，深度遍历，广度遍历-Structural map as a storage structure with the adjacency list, and complete the establishment of the Figure, deep traversal, breadth traversal
Graph(adjacency-matrix)
- 使用邻接矩阵作为存储结构构造图，并完成图的建立，深度遍历，广度遍历-Use the adjacency matrix as a storage structure structure diagram, and complete the establishment of the Figure, deep traversal, breadth traversal
data-structure-Graph
- 本软件围绕无向图的应用这一主题，用图形化的界面实现了无向图的建立、显示邻接表、动态构造最小生成树（分别利用Prim算法和Kruscal算法）、查找最短路径等功能。 具体功能： 给定一个图，完成： （1） 建立并显示出它的邻接链表 （2） 分别用普里姆算法和克鲁斯卡尔算法构造其最小生成树，随时显示其构造的过程 （3） 给出某一确定顶点到所有其他顶点的最短路径 （4） 给出每一对顶点之间的最短路径 说明：程序开发时所用的文件和源码在文件夹“配套文件”中提供。另附说明
graph
- 这个源代码包含了图的邻接矩阵和链表的两种存储方式、深度和广度的遍历以及prim 和kruskal最短路径两种算法。-The source code contains the adjacency matrix and list two storage mode, the breadth and depth of the traversal and prim And kruskal shortest path of two algorithms.
graph
- 以邻接表为存储结构实现无向图的深度遍历和图的广度遍历。-Adjacency list storage structure undirected depth traversal of Figure and Figure breadth traversal.
Graph
- 1、创建一个无向图，采用邻接矩阵存储，顶点采用单个字符表示，边采用邻接矩阵表示； 2、输出该图的存储示意图； 3、对该图进行深度优先遍历和广度优先遍历并输出遍历的结果。 -1, create an undirected graph adjacency matrix storage vertex edges using adjacency matrix representation with a single character 2, the output of the storag
Hyper
- converts a binary undirected adjacency graph into a hypergraph. The output is a non symmetric matrix where the columns are the vertices and the rows are the hyper edges.
graph
- 输出图对应的邻接矩阵以及DFS和BFS结果-The output diagram corresponds to the adjacency matrix as well as the DFS and BFS results
adjacency-list
- 基于邻接表表示的图的遍历包括深度优先遍历和广度优先遍历-Based on the adjacency list representation of the graph traversal, including the depth-first and breadth-first traversal
graph
- 数据结构中对图的操作，图的邻接矩阵，C++代码-The data structure of FIG. Operation FIG the adjacency matrix C++ code,