搜索资源列表
lab4_2
- 2-1以顺序栈作为存储结构 实现顺序栈的入栈运算,出栈运算,并且读取栈顶元素; 2-2以链栈作为存储结构,实现栈上的数据元素的插入运算,删除运算,并读取链栈的栈顶元素; 2-3 以循环队列喂存储结构,实现循环队列的建立,实现循环队列的入队运算,出队运算; 2-4用栈实现括号的匹配问题; 2-5实现汉诺塔问题.; 3-1采用链式存储表示,按给定的先序序列创建二叉树,并输出二叉树。 3-2-1和3-2-2采用二叉链表作为存储结构,建立二叉树,采用递归算法实现二叉树遍历,另外采
traversal-of-the-adjacency-table
- 数据结构采用模块化的方法解决图的邻接表存储及遍历-Storage and traversal of the data structure is modular method to solve the adjacency table
breadth-first-traversa
- 严蔚敏《数据结构》无向图的广度优先遍历算法c++代码实现-Yan Wei-min data structure undirected graph breadth-first traversal algorithm c++ code to achieve
Graph-me
- 数据结构的作业 图的建立,添加,遍历,生成最大生成树,找最短路径等-Graph data structure operations to establish, add, traversal, generating maximum spanning tree, find the shortest path, etc.
1
- 数据结构的算法,包括单链表,队列,先序遍历二叉树,线性表,栈,图等-Data structure algorithms, including single-linked lists, queues, first traversal tree, linear table, stack, diagrams
s6
- 数据结构 在图G中求一条从顶点i到顶点s 的简单路径。 实验目的: 1、掌握图的各种存储结构,尤其熟练掌握邻接矩阵和邻接表存储结构; 2、熟练掌握图的深度优先遍历和广度优先遍历算法; 3、在遍历算法的基础上设计其他应用算法。 -Data structures and seek a graph G from vertex i to vertex s simple path. Experiment: a master chart of the various storage
1
- 这是数据结构的一个C++编程。在邻接矩阵上实现带权图、不带权图的初始化,搜索、插入、删除边,宽度遍历、深度遍历。邻接矩阵用模板类实现。-This is a programming data structure C++. Achieve a weighted graph in the adjacency matrix, with no right of map initialization, search, insert, delete edge, traversing the width and
Handout
- 创建图的邻接表存储结构,输出邻接表数据(验证创建过程),深度优先遍历(DFS) ,广度优先遍历(BFS),增加一个顶点到图, 删除一个顶点(同时删除其所有邻接边) ,增加一条弧到图,从图中删除一条弧- Creating adjacency table storage structure, the output adjacency table data (validation creation process), depth-first traversal (DFS), breadth-fi
graph
- 数据结构 有向图的邻接矩阵、度、拓扑算法。无向图的深度优先遍历、广度优先遍历。最小生成树-Adjacency graph data structure to the matrix, the degree of topological algorithms. Undirected graph depth-first traversal, breadth-first traversal. Minimum Spanning Tree
software-design-I
- c++实现的非常详细的数据结构与算法代码,队列,链表,三元组,哈弗曼树,树的各种递归,非递归遍历算法,树与森林相互转化算法,图的深度,广度优先搜索算法,双连通算法,强连通算法,拓扑排序算法,最短路径算法,哈希,快速排序,归并排序等等。-C++ very detailed data structure and algorithm code, queues, linked lists, three tuple Havermann tree, various recursive tree, non r
ZGraph
- 数据结构 无向图 以邻接矩阵的方式存储一个无向网 1.建立并显示出无向网的邻接矩阵; 2.对该无向网进行广度优先遍历,显示遍历的结果(并随时显示队列的入、出情况); 3.用普里姆算法构造其最小生成树,显示其构造的过程。-Data structure- the undirected graph Stored in the form of adjacency matrix an undirected network 1. Establish and shows the ad
Data-Structure-section-algorithm
- 包含了大学计算机的数据结构算法,Eratosthenes筛选法素数、huffman编码、多种查找、二叉树创建与遍历、多种排序、图的建立和遍历等。 -Contains the data structure algorithms university computers, Eratosthenes screening primes, huffman coding, multiple search, binary tree traversal create a variety of sorting
Graph
- 基于Virtual C++的数据结构中图的应用,能实现从文件输入有向图和无向图易邻接表和邻接矩阵的形式在屏幕输出,同时能实现无向图的深度遍历输出和广度遍历输出;kruskal算法和Prim算法实现最小生成树的创建;Dijkstra算法实现最短路径的计算;以及最小偏心距的计算。-Application of data structure of Virtual in C++ based on graph, can be achieved the file input directed graphs
chandc2
- 图的邻接表存储与深度优先遍历.设计图的邻接表存储结构,数据元素的数据部分可以是随机生成的整数;设计图的深度优先遍历算法;-a vc++ program about the store of a graph and how to go over it
mygraph
- 图的增加,删除,查询操作,遍历图等功能,对于初学数据结构者有些帮助。-it is useful for new learner to learn struct data
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
6
- 《数据结构》 第6次上机题目 ( 图 练习 ) 1. 图的深度优先和广度优先遍历; 2.拓扑排序; 3. 关键路径练习(选做题); 4.最短路径练习(选做题)。-" Data Structure" depth first and breadth sixth title on the machine (Figure Exercise) 1. Graph traversal priority 2. Topological sorting 3. Critical
shujujiegou
- 常见数据结构算法,包括多项式计算,二叉树遍历,链表,图的搜索等-Common data structure algorithms, including polynomial, binary tree traversal, linked lists, graph search, etc.
BFS_graph
- 这是数据结构中图的广度优先算法的实现。广度优先算法是按照每个节点的拥有的孩子数目来进行遍历的。而不像图的深度优先算法是按照深层次,然后如果不能继续进入更深一层,就往回遍历。-BFS program of tree have a large of difference of the DFS program of trees.The produre of it is with the method of the children of a point ,rather than the depth o
GraphPro
- 数据结构实验之图实验代码。实现了根据文本文件提供的信息创建图,实现图的最短路径搜索,遍历等功能。-Data structure experiment the figure of the code. Realized according to the text file to provide information to create diagrams, graph shortest path search, traversal, and other functions.