搜索资源列表
linsang
- 很多涉及图上操作的算法都是以图的遍历操作为基础的，此程序演示出图的遍历的过程。通过邻接矩阵存储结构实现数据俄的输入，实现图的深度优先遍历和广度优先遍历过程的演示，对异常输入信息报错。-map of algorithms are plans to traverse the basis for the operation, this procedure demonstrated map out the ergodic process. Through the adjacency matrix of
图遍历的演示
- 数据结构课程设计题目:试设计一个程序,演示在连通和非连通的无向图上访问全部结点的操作
图遍历应用
- 数据结构的图的遍历应用程序设计算法实现的源代码，请大家多多指教。-data structure plans Ergodic application design algorithm source code, please exhibitions.
algo & data structures graphs
- 图的遍历:图是由顶点集合(vertex)及顶点间的关系集合组成的一种数据结构:Graph＝( V, E ).使用拓扑排序的算法.-traverse the map : The map is set by the vertex (Vertex) and the relationship between peak set consisting of a data structure : Graph = (V, E). The use of topological sorting algorithm.
searchpath
- 数据结构上机实验——图的遍历，建立有向图，可选择深度或广度搜索，并将所有路径输出，简明、易懂、C++、自编版。-Data structure on experiments- graph traversal, the establishment of a directed graph, you can choose the depth or breadth of the search, and all paths output, concise, easy to understand, C++,
tubianli
- 配合数据结构课程的讲义以程序的形式模拟出算法的图，以及图的遍历的程序-With the data structure of the lecture courses in order to process the form of simulated algorithms map and graph traversal procedure
tu
- 数据结构“图”的遍历，尤其针对数据结构课程设计-Data structure " map" of the traverse, in particular data structure for curriculum design
tu2
- 数据结构“图”的遍历，尤其针对数据结构课程设计-Data structure " map" of the traverse, in particular data structure for curriculum design
tudebianli
- 图的遍历问题 数据结构 C C++ 源码 课程设计 严蔚敏版的书-yrteryryer
jieguo
- 大学生数据结构实验报告，有关图的遍历，源程序和结构-Students data structures lab reports, graph traversal, source and structure
bianli
- 数据结构中图的遍历。通过手动输入，采用邻接矩阵创建无向图，再通过计算，完成对该图进行土的深度优先遍历。-Graph traversal of the data structure. By manually entering the adjacency matrix to create an undirected graph, by calculating the complete depth-first traversal of the soil of the graph.
Graph
- 数据结构中图的遍历Data structure traversal of center-Data structure traversal of center
graph
- 数据结构图的存储和遍历，包括邻接矩阵方式存储图和图的查找-The data structure of the storage and traversal, including the adjacency matrix storage map and map search
DFSBFS
- 数据结构图的遍历算法，DFS（深度优先便利）和BFS（广度优先遍历）-DFS and BFS DATA STRUCT
hw12---CreateAdjDWGraph
- 数据结构图实现，图的遍历，构建，广搜深搜，邻接顶点，入度和出度，代码可以直接运行-graph achieve
tu-de-bian-li-CPP
- 数据结构中，图的遍历算法，VC++，简单易懂适合初学者！-Data structures, graph traversal algorithm, C++, easy to understand for beginners!
算法与数据结构实习
- 普利姆算法，图的遍历，英文字母表的小程序，都是可运行的(Pliem algorithm, graph traversal, English alphabet)
text13
- 通过邻接表来构建一个无向图，然后分别深度遍历图以及广度遍历图(Build a graph by adjacency table, and then traverse the map in depth and breadth)
ConsoleApplication1
- 实现图的广度优先遍历，利用结构体指针，非常适合数据结构初学者。(Breadth first traversal of Graphs)
图
- 实现了图的创建，遍历，输出以及广度深度的遍历。(The creation, traversal, output and breadth and depth traversal of the graph are realized.)