搜索资源列表
guangduyouxianbianli
- 实现图的广度优先遍历:数据结构课程设计-err
tdbl
- 图的遍历算法cpp程序，有类Graph，可以直接创建对象调用相关函数，ACM比赛适用-Graph traversal algorithm cpp procedures have category Graph, can directly create an object called correlation function, ACM applicable competition
zz
- 图的相关操作：建立图，图的遍历，查找元素，删除元素等-Map-related steps: the establishment of map, graph traversal, find elements, delete elements, etc.
tubianlideyanshi
- 关于图遍历的演示包括所有的源代码和执行文件，内容齐全，数据结构的有关作业-Ergodic on the map presentation, including all source code and implementation of document, content complete, the data structure of the operating
datastructure
- 设计邻接表类,实现无向图的深度优先非递归遍历,无向图的广度优先遍历,并设计主函数输入数据进行测试-Design category adjacency list, realize undirected graph of the depth-first traversal non-recursive, non-directed graph breadth-first traversal, and the design of the main
shortestpath
- 图的遍历，在连通的无向图上访问全部节点的操作-Graph traversal, in the undirected graph connectivity to access all the nodes to operate
tudejibencaozuo
- 数据结构中关于图的基本操作。对给定图，实现图的深度优先遍历和广度优先遍历。-Data structure on the basic operation of Fig. On a given map, the realization of the depth-first graph traversal and breadth-first traversal.
883winedis_and_search
- 包括883分酒问题，图的遍历等人工智能基本算法-Including 883 hours of liquor problem, artificial intelligence, such as graph traversal algorithm
org
- 使用Java开发的图论算法的包，里面含有图论的各种算法，如：地杰斯特拉，图的遍历算法-Java development using graph theory algorithms package, which contains a variety of graph theory algorithms, such as: to杰斯特拉, graph traversal algorithm
hafuman
- 本程序实现图的遍历，哈弗曼的遍历。这个程序能很顺的找到一个图的遍历-This procedure to achieve graph traversal, the traversal哈弗曼. This process can be very smooth to find a graph traversal
zhifangtu
- 主要是图的建立，和图的遍历，还有图的元素查找-Mainly the establishment of plans, and the graph traversal, there are plans to find the elements
BFSTraverse
- 图的遍历_邻接表存储.cpp 检验深度优先和广度优先的程序(邻接表存储表示)-Graph traversal _ adjacent table storage. Cpp test the depth and breadth of the priority of priorities Procedure (adjacent table, said storage)
GRAPH3
- 实现图的遍历，主要是实现对无向图中是否存在有值为k的路径的算法实现-The realization of graph traversal, mainly the realization of undirected graph whether there is a value of k path algorithm
TraversingGraph
- 图的遍历算法是求解图的连通性问题、拓扑排序和求关键路径等算法的基础-Graph traversal algorithm is to solve the graph connectivity problem, topological sorting and demand, such as critical path algorithm
tu
- 图的建立以及深度遍历，该代码很简单，是用链式存储的-Map-building, as well as the depth of traversal, the code is very simple, with chain store
graph
- 图的遍历 能实现深度 广度遍历 还有文挡-Graph traversal to realize the depth of breadth traversal also text block
sjjgt
- 【数据结构】图的遍历，包含（栈类型、图类型、队列类型）-[] Map data structure traversal, including (stack type, map type, queue type)
tubianli
- 配合数据结构课程的讲义以程序的形式模拟出算法的图，以及图的遍历的程序-With the data structure of the lecture courses in order to process the form of simulated algorithms map and graph traversal procedure
tu
- 图的深度优先遍历，数据结构实验，源码可运行-Map depth-first traversal, the structure of the experimental data, source code can be run
topsorting
- 此函数功能是图的遍历算法，用邻接矩阵存储图，然后求出其拓扑排序，再输出其图的信息-Function is to map the function of the traversal algorithm, the adjacency matrix storage map, then calculated the topological sort, then the output of its map information