搜索资源列表
graph
- 实现了图的主要操作:(1)分别用邻接矩阵和邻接表实现图的基本操作(包括图的广度和深度优先搜索);(2)判断该图是否连通,输出该图的连通分量数目;(3)输出一个每一个连通分量的最小生成树。
数据结构的常用算法
- 这是数据结构c语言的几个常用算法。分别是广度和深度优先遍历,最小生成树和最短路径。
graph
- 数据结构C对图的操作算法,有广度、深度优先遍历,拓扑排序,最短路径的实现算法,最小生成树的算法-C data structures to operate on the map algorithm, there is the breadth, depth-first traversal, topological sorting, shortest path algorithm, minimum spanning tree algorithm
graph1
- 图的运算,有全图的无权图的广度深度优先遍历-Figure computing, there is no right to map the entire map of the breadth of depth-first traversal
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
zong
- 这是数据结构c语言课本的几个常用算法代码。有广度和深度优先遍历。最小生成树,最短路径,拓扑排序。-This is the data structure of c language textbooks code of several commonly used algorithms. Have the breadth and depth-first traversal. Minimum spanning tree, shortest path, topological sort.
creatgraph
- 图的建立和图的广度深度优先遍历(有向图和无向图)-Map creation and map the breadth of depth-first traversal (with the map and undirected graph)
bianli
- 图的遍历,对有向图进行广度和深度优先遍历。-Graph traversal, directed graph on the breadth and depth-first traversal.
graph
- 本程序可实现图的构建,对节点数没有要求,并能实现广度深度优先遍历,-This procedure enables the construction plans, there is no requirement on the number of nodes, and to achieve breadth depth-first traversal,
graph-travel
- 图的广度和深度优先遍历算法的实现,功能为图的遍历算法-graph travel
wideanddeepsearch
- 该代码实现的主要功能是实现广度以及深度优先搜索-The code of its main function is to realize breadth and depth first search
Basic-function-of-graph
- 图的基本操作,包括建立邻接矩阵,图的广度和深度优先搜索-The basic operation pattern, including the establishment of the adjacency matrix, the breadth and depth map of priority search
traversal
- 1.输入顶点的个数、边的个数、每个顶点的值以及每一条边的信息,构建一个无向图G,并用邻接矩阵存储该图。 2.深度优先遍历第1步中构造的图G,输出得到的结点序列。 广度同上-Diagram breadth-first traversal&&deep first