搜索资源列表
图的基本操作
- 实现图的各种基本操作 图的建立 删除 查找 遍历-plans to achieve the basic operation of the plan is to establish delete you traverse
图的建立
- 建立并输出图
图的建立，遍历，生成树
- 图的建立，遍历，生成树。图的建立，遍历，生成树。图的建立，遍历，生成树。
graph
- 自己写的一个图的建立程序-To write a map to establish procedures
Tu
- 有向加权图的建立、显示和寻找最短路径- Has to the weighting chart establishment, demonstrated and seeks the most short-path
TU
- 邻结表存储的无向图的建立及遍历输出（包括深度优先与广度优先搜索）- The neighbour ties the table to save non- (first first searches to the chart establishment and the calendar output including depth with breadth)
GraphA
- 图的建立与遍历算法。-map and the establishment of traversal algorithm.
tu_bianli
- 图的建立与多种遍利方法-map and the establishment of a variety of methods !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!! good times
图的操作界面
- 图邻接表的建立,深度优先遍历,.广度优先遍历,最小生成树,拓扑排序,单源点到其余各个顶点的最短路径等对图的操作!VC界面!-plans to establish the adjacent table, depth-first traversal. Breadth priority traversal, the minimum spanning tree, topological sorting, single-source all of
Leasen图的建立和DFS&BFS算法
- 数据结构中关于DFS和BFS的练习，较简单的实现了二叉树的DFS和BFS搜索-data structure of DFS and BFS practice, the realization of a simple binary tree search DFS and the BFS
jianshanfei
- 该程序实现图的建立与先深和先广遍历，图采用矩阵存储，在遍历过程中用栈实现，但若改用队列，将会实现得更自然流畅-the program plans to establish the first and the first deep-Traversal, map storage matrix, Traversing in the process of making Stack, but switch queue, there will be
Soft20060210100933557
- 图的建立、遍历、最小生成树、最短路径 图的建立、遍历、最小生成树、最短路径-plans the establishment, traverse, the minimum spanning tree and the shortest road map for the establishment of traversal, minimum spanning tree, shortest path
BFS11223
- 该程序实现了 无向图的建立和广度优先搜索及输出-the program no plans to the establishment and BFS and output
44
- 数据结构图的建立和使用 包挂路径查询-map data structure, the establishment and use of packet path linking inquiries, etc.
tu
- 图的建立，图的广度优先遍历，深度优先遍历，邻接表等，c语言-Chart the establishment of the breadth-first graph traversal, depth-first traversal, such as adjacency list, c language
13094056703
- 一些经典CC++程序源码 1、 运动会分数统计** 2、 订票系统 3、拓扑排序4、 迷宫求解5、 文章编辑**6、 joseph环 7、 猴子选大王**8、 建立二叉树，层序、先序遍历（ 用递归或非递归的方法都可以）**9、 赫夫曼树的建立 10、 纸牌游戏**11、图的建立及输出-Some classic CC++ Program source 1, Games Score Statistics** 2, 3 booking sys
tu
- 图的建立以及深度遍历，该代码很简单，是用链式存储的-Map-building, as well as the depth of traversal, the code is very simple, with chain store
create_graphic
- 图的建立，有多种的图可以选择，也可以选择图的遍历方法，里面的图的存储结构是以顶点数组和邻接矩阵的方式存储的。-Map-building, there are several plans to choose, you can choose to graph traversal method, which the storage structure of the plan is based on vertex adjacency matri
graphic_vist
- 图的遍历，里面也包括图的建立，有各种形式的图可以选择，符合多种需求。-Graph traversal, which also includes the establishment of plans, there are various forms of plans to choose, consistent with a variety of needs.
图的深度和广度搜索
- 关于图的邻接矩阵的建立和广度和深度遍历结果显示(The establishment of the adjacency matrix of a graph and the result of the breadth and depth traversal)