搜索资源列表
SiWuZhang
- 这章是四五章。我们上课时的课件,非常有条理,想学习数据结构的同学可以下载来学习,里面有完整的代码介绍,线性表/链表/二叉树/邻接矩阵/图等~我们上机就都从里面拷代码,是非常好的学习资料~。-This chapter is four or five chapters. Courseware in our class, very organized, want to learn data structures students can download to learn, there are a c
Graphtraversalexperimentreport
- 以邻接多重表为存储结构; 2、实现连通和非连通的无向图的深度优先和广度优先遍历; 3、要求利用队列实现无向图的深度优先遍历; 4、以用户指定的结点为起点,分别输出每种遍历下的结点访问序列; 5、求出从一个结点到另外一个结点,但不经过另外一个指定结点的所有简单路径; 6、测试数据: 输入:顶点数,边数:8,10 各边:1,2 1,3 2,4 2,5 3,6 3,8 4,7 5,6 5,7 7,8 输出:深度
main
- 图的邻接链表存储和遍历,C语言课程设计大作业,包括广度优先和深度优先。-The adjacency lists storage and traversal, C language curriculum design operations, including the breadth-first and depth-first.
AdjacencyListUndirectedGraph.r
- 《数据结构》课程中,邻接链表无向图的C++实现。具有很好的参考价值!,The implementation of Adjacency lists undirected graph by C++ programming language.
s2
- 邻接链表的建立、两种算法生成其最小生成树以及其显示、每一对顶点的最短路径-Adjacency list creation, two algorithms to generate the minimum spanning tree, and its display, the shortest path for each pair of vertices
Storage-experiments-undirected-graph
- 1)将右图按照邻接多重表进行存储 2)依次输出顶点表中,各顶点的数据值 3)根据邻接多重表,依次输出依附于各顶点的边,如:A: (A,B), (A,E),(A,D)。 -1) to the right in accordance with the adjacent multi-table memory 2) sequentially outputs the vertex of the table, the data values of the vertic
linjielianbiao
- 大学数据结构上机作业,C++语言写的邻接链表,练习邻接链表的工作机制。-Data structures, the use of adjacency lists
Graph-Alothrim
- 利用邻接链表的形式存储图,并进行深度优先访问。-Using adjacency list is stored in the form of maps, and depth-first visit.
LGraph
- 是关于图的实现,是用的邻接链表法,用C语言实现的,希望能给大家一个参考-Is the realization of graphic, with the adjacency list method, using C language, I hope to give you a reference
transport
- 上海地铁邻接矩阵表,包含生成程序,输入为每条线线路站台名称~-Shanghai metro adjacency matrix, containing the generated program, enter the site name for each line line ~
graphics
- 图的基本操作:包括建立有向图和无向图的邻接链表,图的两种遍历操作等。-Basic Operation Figure: including the establishment of a directed graph and undirected graph adjacency list, plans of the two operations.
yubianli
- 以邻接多重表为存储结构,实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点,分别输出每种遍历下的结点访问序列和相应生成树的边集。-his is a graph traversal demo source code is written in c language, we can refer to this algorithm
depth-first-traversal
- 这是一个数据结构中二叉树的邻接链表的建立以及广度优先遍历和深度优先遍历的算法,对于初学者来说,这样的算法简单易懂,非常容易上手-This is to establish and breadth of a binary tree data structure adjacency list first traversal and depth-first traversal algorithm, for starters, this algorithm is simple to understand
PrimAdjLinkList
- 这可以作为头文件;图结构中,基于邻接链表的prim算法-Graph, adjacency list based on prim algorithm
Graphmtx
- 数据结构图的邻接矩阵的实现。 包括构造函数、返回边(v1,v2)上的权值的函数、在图的顶点表中插入一个新顶点的函数、在带权图中插入一条边的函数、给出顶点位置为v的第一个邻接顶点的位置的函数、给出顶点v的邻接顶点w的下一个邻接顶点的位置的函数、在图中删除一条边的函数、在图中删除一个指定顶点v, v是顶点号的函数等优质函数。-Data Structure adjacency matrix. Including the constructor function that returns th
kailulinjie
- 对于最短路问题,已知平面区域0≤x≤1400,0 ≤y≤1200的高程数据见表,求取赋权邻接矩阵的函数-For the shortest path problem, flat area known elevation data in Table 0≤x≤1400,0 ≤y≤1200 strike empowerment adjacency matrix function
XGraph
- 数据结构 有向网 对以邻接链表的方式存储的一个有向网 1.建立并显示出有向网的邻接链表; 2.对该有向网进行深度优先遍历(递归或非递归都可以),显示遍历的结果; 3.给出某一确定顶点到所有其它顶点的最短路径及其长度。-Data structure- to the network For storage in the form of adjacency list a directed network 1. Establish and shows have to mesh a
polynomial
- 实现多项式的加减等算法,用VC++实现,为邻接链表的应用,比较基础的数据结构。-Polynomial subtraction algorithms, with VC++ achieve, as a contiguous list of applications, the basis of comparison of data structures.
Graph
- C语言建立图,图的广义优先搜索和深度优先搜索,领接表与邻接矩阵转换-Graph and Graph Application
Gragh
- 图的数据结构,打包cpp,1.创建图 创建图 G(任选邻接矩阵或表) 2. 显示图 3. 深度优先搜索遍历图 4. 广度优先搜索遍历图 5. 在图中插入顶点 6. 在图中插入边- Graph data structure, packaging cpp, 1. Create a map creation graph G (optional adjacency matrix or table) 2. Display Figure 3. depth-first se