搜索资源列表
graph
- 本程序可实现图的构建，对节点数没有要求，并能实现广度深度优先遍历，-This procedure enables the construction plans, there is no requirement on the number of nodes, and to achieve breadth depth-first traversal,
BFSandDFS
- 使用C语言编写的对与邻接矩阵无向图的输出及深度优先遍历和广度优先遍历实现源代码有demo测试图片，对于理解邻接矩阵无向图有很大帮助-Written using C and the adjacency matrix of undirected graph of output and depth-first traversal and breadth-first traversal with demo source code to achieve the test images, for under
BFSandDFSList
- 对数据结构中图一部分采用邻接表实现无向图的建立、深度优先遍历和广度优先遍历算法实现，成功运行，有测试数据-Part of the data structure used in the adjacent table to achieve the establishment of an undirected graph, depth-first traversal and breadth-first traversal algorithm, the successful operation, a t
PBFSandDfsList
- 数据结构中对有向图采用邻接表为存储结构实现对有向图的建立、深度优先遍历和广度优先遍历，同样有测试数据-Data structure of a directed graph with adjacency table for the storage structure to achieve the establishment of a directed graph, depth-first traversal and breadth-first traversal, the same test da
Graph-traversal-spanning-tree
- 1．显示图的邻接矩阵, 图的邻接表, 深度优先遍历, 广度优先遍历, 最小生成树PRIM算法, 最小生成树KRUSCAL算法,图的连通分量。 2．当用户选择的功能错误时，系统会输出相应的提示。 3．通过图操作的实现，把一些实际生活中的具体的事物抽象出来-Shown FIG s adjacency matrix, graph the adjlink, depth-first traversal, breadth first traverse, minimum spanning tree m
tu
- 遍历算法在数据结构中是最普通的运算方法也是所有其它算法的基础。由于图的遍历比线性表、树的结构的遍历算法要复杂,因此着重对图的遍历算法进行讨论, 具有更普遍的意义。图的遍历就是从图中指定的某顶点作为遍历的起始出发点, 按照一定搜索遍历路径, 对图中所有顶点仅作一次访问的过程。 根据搜索路径方向的不同, 遍历图的方法可分深度优先搜索遍历和广度优先搜索遍历, 又根据编制算法的方法不同, 可分为递归遍历算法和非递归遍历算法。 -Data structure traversal algorithm
tu
- 图的邻接表建立以深度，广度优先及遍历，和最短路径-Adjacency table to establish the depth and breadth-first traversal, and the shortest path
Topological_order
- 这是一个基于图的拓扑排序的小程序，有深度优先和广度优先两种方法遍历-This is a graph-based topological sort of small programs, depth first and breadth-first traversal of two ways
LJJZ
- 显示图的邻接矩阵, 图的邻接表, 深度优先遍历, 广度优先遍历, 最小生成树PRIM算法, 最小生成树KRUSCAL算法,图的连通分量-Shows the adjacency matrix, adjacency table, depth-first traversal, breadth-first traversal, minimum spanning tree PRIM algorithm, minimum spanning tree KRUSCAL algorithm, graph conn
shanzhash
- 在人工智能领域，对隐式图的搜索是求解问题的一种基本方法，本程序通过使用多种图搜索策略，对 重排九宫问题进行求解，演示了“广度优先搜索”、“深度优先搜索”、“有界深度优先搜索”、 “最好优先搜索”和“局部择优搜索”五种基本的图图搜索策略。 整个程序使用了动画技术，界面设计美观友好，使用方便。-In the field of artificial intelligence, implicit graph search is a basic method of solving proble
092880-4
- 图的相关操作，涉及到邻接矩阵，邻接表，深度优先、广度优先遍历等等。-Graph related operations, involving adjacency matrix, adjacency table, depth first, breadth-first traversal and so on.
TU2
- 编写程序以邻接矩阵或邻接表的方式存储指定连通图。然后分别用深度优先算法和广度优先算法遍历邻接矩阵方式存储的图和邻接表方式存储的图。-Write a program to the adjacency matrix or adjacency list stored in a manner specified connected. Then were used to depth-first traversal algorithm and the breadth-first algorithm stor
aa
- 图的邻接表存储及深度优先遍历的实现代码 实现代码-Adjacency table to store and depth-first traversal of the implementation code
tudecaozuo
- 有向图,无向图基本操作,包括: 1、邻接矩阵 2、邻接表 3、深度优先遍历 4、广度优先遍历 5、最小生成树 6、拓扑排序 7、每一对顶点之间的最短路径（Dijkstra,Floyd两种算法）-Directed graph, undirected graph, basic operations, including: 1, 2 adjacency matrix, adjacency table 3, 4 depth-first traversal, breadth-f
CSharp---DFS-BFS
- 实现图的交互输入，可创建邻接表，还可进行深度优先遍历广度优先遍历，拓扑排序等-To achieve interactive map input, you can create adjacency table, but also for the breadth-first traversal depth-first traversal, topological sorting
scj_Graph
- 数据结构中有关图的创建，存储显示，深度，广度优先遍历算法，以及最小生成树Prim和Kruscal算法实现-The map data structure to create, store display, the depth, breadth-first traversal algorithm, and Prim minimum spanning tree algorithm and Kruscal
tutututu
- C++编程，图的遍历算法。广度优先遍历和深度优先遍历算法都有。-C++ programming, graph traversal algorithm. Breadth-first and depth-first traversal.
graph
- 数据结构实验六图的操作，在程序中提示输入的顶点数以及每两条边之间的权值，最后使用深度优先和广度优先算法实现遍历，同时构建最小耗费生成树的最小权值和路径。-Experimental data structure diagram of the operation of six, in the program prompts for the number of vertices and edges between every two weights, the final depth-first and
Traversing-Graph
- 通过深度优先遍历与广度优先遍历算法实现图的遍历-By depth-first traversal and breadth-first traversal graph traversal algorithm
Graph-traversal
- 图的遍历(含深度优先搜索与广度优先搜索，主函数)-Graph traversal (depth-first search and breadth-first search)