搜索资源列表
2007char
- 利用邻接矩阵的图深度优先遍历算法，调试通过，无毒！-use of adjacency matrix plans depth-first search algorithm, through testing, drug-free!
2007char2
- 利用邻接表的图深度优先遍历算法，调试通过。无毒-use adjacent table plans depth-first traversal algorithm, through debugging. Nonpoisonous
tu
- 图的建立以及深度遍历，该代码很简单，是用链式存储的-Map-building, as well as the depth of traversal, the code is very simple, with chain store
TU
- 图的基本操作，包括查找，遍历，删除，邻接表和邻接矩阵的转换-Fig basic operations, including search, traversal, delete, adjacency list and adjacency matrix conversion
1
- 利用邻接表存储无向图,并深度遍历和广度遍历图-Storage without the use of the adjacent table to the map, and the depth and breadth traversal graph traversal
GraphTraversal
- 使用c语言，利用数据结构思想建立图的邻接表的存储结构，实现无向图的深度优先遍历和广度优先遍历。以用户指定的顶点为起点，分别输出每种遍历下的顶点访问序列。 设图的顶点不超过30个，每个顶点用一个编号表示（如果一个图有N个顶点，则它们的编号分别为1，2，…，N）。通过输入图的全部边输入一个图，每条边是两个顶点编号对，可以对边依附顶点编号的输入顺序作出限制（例如从小到大）。 -Using c language data structure used to establish the adjac
tu
- VC++编程，实现图的创建及遍历。北航软件技术基础作业。-VC++ programming, graph creation and traversal. Beihang software technology base job.
adjacency-list
- 基于邻接表表示的图的遍历包括深度优先遍历和广度优先遍历-Based on the adjacency list representation of the graph traversal, including the depth-first and breadth-first traversal
12123450
- 输入图的顶点和边的信息建立图，并对其进行深度和广度遍历，输出遍历结果。-Input graph vertices and edges of the information to establish the figure, and its depth and breadth traversal, traverse the output results.
traverse-of-graphs
- 一个简单的图的遍历小程序-traverse of graphs
Web-Spider
- 图的遍历。若用有向网表示网页的链接网络，其中顶点表示某个网页，有向弧表示网页之间的链接关系。试设计一个网络蜘蛛系统，分别以广度优先和深度优先的策略抓取网页。-Graph traversal. If the web page to the network by indicating links network where vertices represent a page, there are links to the arcs represent the relationship between