文件名称:tudebianli
介绍说明－－下载内容均来自于网络，请自行研究使用
一、 程序分析
1． 以邻接多重表为存储结构，实现连通或非连通的无向图的深度优先与广度优先遍历。
2． 设图的结点不超过30个，每个结点用一个编号表示。通过输入图的边输入一个图，每条边为一个数对。
3． 问题描述：
4． 以第一个结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边。
-First, program analysis 1. To the adjacent multi-table for the storage structure, to achieve connectivity and non-connected undirected graph with a depth-first breadth-first traversal. 2. Node-based map is not more than 30, each node with a number that. Map by entering the input side of a graph, and each side for a few right. 3. Problem Descr iption: 4. To the first node as a starting point, respectively, under the output of each node traversal visit sequences and the corresponding spanning tree edge.
1． 以邻接多重表为存储结构，实现连通或非连通的无向图的深度优先与广度优先遍历。
2． 设图的结点不超过30个，每个结点用一个编号表示。通过输入图的边输入一个图，每条边为一个数对。
3． 问题描述：
4． 以第一个结点为起点，分别输出每种遍历下的结点访问序列和相应生成树的边。
-First, program analysis 1. To the adjacent multi-table for the storage structure, to achieve connectivity and non-connected undirected graph with a depth-first breadth-first traversal. 2. Node-based map is not more than 30, each node with a number that. Map by entering the input side of a graph, and each side for a few right. 3. Problem Descr iption: 4. To the first node as a starting point, respectively, under the output of each node traversal visit sequences and the corresponding spanning tree edge.
相关搜索： 无向图
(系统自动生成,下载前可以参看下载内容)
下载文件列表
图的遍历的演示（课程设计）
..........................\piggybank.txt
..........................\主程序.txt
..........................\入队操作.txt
..........................\出队操作.txt
..........................\创建图.txt
..........................\初始化队列.txt
..........................\判断队列是否为空.txt
..........................\图的遍历的演示
..........................\..............\图的遍历的演示.txt
..........................\定义图.txt
..........................\定义队列.txt
..........................\广度遍历.txt
..........................\打印图的邻接矩阵.txt
..........................\新建 文本文档.txt
..........................\深度递归遍历.txt
..........................\获取下一个未被访问的邻接节点(深度遍历).txt
..........................\课程设计（图的遍历）
..........................\....................\图的遍历..doc
..........................\piggybank.txt
..........................\主程序.txt
..........................\入队操作.txt
..........................\出队操作.txt
..........................\创建图.txt
..........................\初始化队列.txt
..........................\判断队列是否为空.txt
..........................\图的遍历的演示
..........................\..............\图的遍历的演示.txt
..........................\定义图.txt
..........................\定义队列.txt
..........................\广度遍历.txt
..........................\打印图的邻接矩阵.txt
..........................\新建 文本文档.txt
..........................\深度递归遍历.txt
..........................\获取下一个未被访问的邻接节点(深度遍历).txt
..........................\课程设计（图的遍历）
..........................\....................\图的遍历..doc