文件名称:tu
-
所属分类:
- 标签属性:
- 上传时间:2014-03-07
-
文件大小:45kb
-
已下载:2次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
图的深度优先与广度优先遍历
利用邻接矩阵或邻接表作为存储结构建立一个无向图,每个顶点中存放一种水果名(例如apple、orange、banana等,并要求从键盘输入),顶点数不少于5个。要求分别以深度优先搜索(DFS)和广度优先搜索(BFS)进行遍历,输出遍历结果。
-Depth-first and breadth-first traversal
Adjacency matrix or adjacency list use as a storage structure to build an undirected graph, each vertex is stored in a fruit name (such as apple, orange, banana, etc., and require input from the keyboard), no less than five vertices. Were asked to depth-first search (DFS) and breadth-first search (BFS) traversal, output through the results.
利用邻接矩阵或邻接表作为存储结构建立一个无向图,每个顶点中存放一种水果名(例如apple、orange、banana等,并要求从键盘输入),顶点数不少于5个。要求分别以深度优先搜索(DFS)和广度优先搜索(BFS)进行遍历,输出遍历结果。
-Depth-first and breadth-first traversal
Adjacency matrix or adjacency list use as a storage structure to build an undirected graph, each vertex is stored in a fruit name (such as apple, orange, banana, etc., and require input from the keyboard), no less than five vertices. Were asked to depth-first search (DFS) and breadth-first search (BFS) traversal, output through the results.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
天津理工大学数据结构实验报告4.doc
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.