搜索资源列表
Tree_Graph
- 本工程包含二叉树和图的相关基本操作，源码包括二叉树的前序、中序、后序、层次遍历，求树高和树宽，创建、删除二叉树或某个结点，通过前序和中序序列得后序序列；图的创建（邻接矩阵或邻接表表示），深度优先和广度优先搜索，求关键路径，普里姆算法求最小生成树等，放到Visual C++工作区即可使用。(This project contains the basic operation of the binary tree and the graph. The source code includes the
邻接矩阵与邻接表相互转化
- 数据结构图论部分，邻接矩阵转邻接表，用C语言实现，再加几个字才够20字(The data structure graph, adjacency matrix to the adjacency list, using C language, plus a few words to 20 words)
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
图的深度和广度搜索
- 关于图的邻接矩阵的建立和广度和深度遍历结果显示(The establishment of the adjacency matrix of a graph and the result of the breadth and depth traversal)
第三次实验课（1）
- 1、定义邻接矩阵存储的图类Graph_Matrix . 2、实验验证如下算法的正确性、各种功能及指标： 1）创建一个邻接矩阵存储的图； 2）返回图中指定边的权值； 3）查找图中某顶点的第一个邻接顶点、某顶点关于另一个顶点的下一个邻接顶点序号； 3、4）图的深度优先遍历； 5）基于普里姆算法求最小支撑树。【选作】(1. Define the graph class Graph_Matrix which is stored by the adjacency matrix. 2. The
sy10(1)
- 图的存储结构与遍历 （1）画出如图（1）所示无向图的邻接矩阵和邻接表，列出该图的广度优先遍历和深度优先遍历结果（选定A为出发点进行遍历）。 （2）画出如图（2）所示有向图的邻接矩阵和邻接表，列出该图的广度优先遍历和深度优先遍历结果（选定A为出发点进行遍历）(The storage structure of the graph and traversal (1) draw the adjacency matrix and adjacency list of the und
Globalpath
- 通过深度优先遍历的图搜索方式，从邻接矩阵中搜索全局路径(Searching the global path from the adjacency matrix through the search method of depth first traversal of the graph)
suijitu1
- 复杂网络随机图生成，并生成邻接矩阵。运用MATLAB实现。(The random graph of complex network is generated and the adjacency matrix is generated.)
无向图
- 无向图的创建，转化为邻接矩阵输出，及深度、广度优先遍历(The creation of undirected graph is transformed into adjacency matrix output and depth and breadth first traversal.)
图的生成
- 设计无向网的图文件格式，读取图文件，生成基于邻接矩阵和邻接表的无向网，并将邻接矩阵表示法和邻接表表示法相互转换。(The graph file format of the undirected network is designed, the graph files are read, the undirected network based on the adjacency matrix and the adjacency table is generated, and the adjacen
图的遍历
- 构造图的邻接表，实现图的深度优先和广度优先算法。(Structure graph adjacency table, graph depth first and breadth-first algorithm.)
dg
- 实现有向图的数据结构，有向图的邻接表存储结构(Realizing the data structure of direction graph,and adjacency table storage structure of digraph)
第五次作业
- 输入或存储任意一个无向图，显示图的深度优先搜索遍历路径和广度优先搜索遍历路径。 要求： 1）基于图的邻接表存储结构实现。 2）基于图的邻接矩阵存储结构实现。(Input or store any undirected graph to show the depth first search traversal path and breadth first search traversal path of the graph Requirement 1 the implement
无向图
- 广工数据结构实验-（无向图）基于邻接数组的无向图的接口实现（含源代码+实验报告+可执行程序）(Data structure experiment - (undirected graph) interface implementation of undirected graph based on adjacency array (including source code + experiment report + executable program))