搜索资源列表
BDFS
- 用邻接表表示无向图的深度优先搜索遍历 有助于大家理解图的优先遍历问题-adjoining table with no plans to the depth-first search traverse help you understand the plans of the priority issues Traversing
maze dfs
- dfs 深度优先搜索！这是走迷宫的基本算法。用广义表建立迷宫，用邻接表建立图，用dfs搜索，许多大学的数据结构作业-dfs depth-first search! Maze This is the basic algorithm. Generalized Table established maze, with the establishment of the adjacent table map, with dfs search, the University of many data str
图的操作界面
- 图邻接表的建立,深度优先遍历,.广度优先遍历,最小生成树,拓扑排序,单源点到其余各个顶点的最短路径等对图的操作!VC界面!-plans to establish the adjacent table, depth-first traversal. Breadth priority traversal, the minimum spanning tree, topological sorting, single-source all of the rest of the vertices such
0801
- 功能：构造图，并进行图的深度优先遍历（邻接表存储结构），图的广度优先遍历，内附详尽的源代码说明-function : tectonic map, and map depth-first traversal of the (storage structure adjacent table), the breadth of the plan priority traversal, enclosing a detailed note of the source code
图的邻接表实现
- 图的邻接表示实现。用来在C++环境下实现图的邻接表示。（数据结构程序）-adjacent said of the plan to achieve. C environment for the realization of the plan under the adjacent said. (Data Structure procedure)
图的搜索
- 在VC的环境下，用C++实现A*算法和双向A*算法，并且能够通过设置不同的参数随机产生以邻接表存储网络图，从而可以对不同启发策略的A*算法进行测试和实验。-in VC environment, the C achieving A * algorithm and the two-way A * algorithm, and through a variety of parameters to generate random adjacent table storage network map, t
graph_adjlist
- 邻接表创建图 通过邻接表存储表示法创建图-adjacent table created by the adjacent table map storage pledged to create map
graphserch
- 此个小程序是用于实现图的操作的,用邻接表的形式存图,实现遍历的函数-this small procedure is used to implement the plan to operate, with the adjacent table in the form of retention plan to achieve iterated function
sortling
- 实现图的脱坡排序，深度优先广度优先，以及建立邻接表-achieve slope from the map, in order of priority depth breadth priority, and the establishment of the adjacent table
e7_14
- 邻接表的建立以及各种功能的源代码，里边有相应的注释-table adjacent to the establishment of the various features of the source code inside a corresponding Notes
AOESEARCH
- 无向图的邻接表的建立和遍历-no plans to the table adjacent to the establishment and ergodic
graph.yangxu
- 熟悉图的存储方式，实现图的邻接矩阵或者邻接表的存储方式下的基本运算，特别是深度遍历和广度遍历；掌握以图为基础的一些常用算法，如最小生成树、拓扑排序、最短路径等。-Familiar with the map of storage practices, and achieve adjacency matrix or adjacency list is stored under the basic operations, especially in the depth and breadth trav
Traversing_Graph
- 树的邻接表表示和邻接矩阵表示，以及图的广度优先和深度优先遍历。-Tree adjacency list representation and adjacency matrix representation, and the graph breadth-first and depth-first traversal.
graph
- 运用VC++ 编写的图的邻接矩阵存储和邻接表存储，并对图进行遍历-it is the storage of the graph
017
- 建立图的邻接表,输出图的邻接表,深度优先遍历,广度优先遍历-CreateGraph,OutputGraph,DFSTraverse, BFSTraverse
graph
- windows下实现图的所用功能，包括：创建有向图和无向图的邻接表，给出有向图的邻接表,创建出逆邻接表-windows used to achieve chart features, including: creating a directed graph and undirected graph of adjacency list is given with the adjacency table, create a reverse adjacency list, etc.
GraphTraversal
- 使用c语言，利用数据结构思想建立图的邻接表的存储结构，实现无向图的深度优先遍历和广度优先遍历。以用户指定的顶点为起点，分别输出每种遍历下的顶点访问序列。 设图的顶点不超过30个，每个顶点用一个编号表示（如果一个图有N个顶点，则它们的编号分别为1，2，…，N）。通过输入图的全部边输入一个图，每条边是两个顶点编号对，可以对边依附顶点编号的输入顺序作出限制（例如从小到大）。 -Using c language data structure used to establish the adjac
6_7
- 实现数据结构 中图结构的邻接表存储结构算法，以及深度优先遍历算法。(The adjacency table storage structure algorithm for the graph structure in the data structure and the depth first traversal algorithm are realized.)
邻接矩阵与邻接表相互转化
- 数据结构图论部分，邻接矩阵转邻接表，用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