文件名称:Without-the-adjlink-to-map
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:22.52kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
从键盘输入无向图G的顶点个数v及边的个数e。建立有v个顶点、e条边构成的无向图G,采用邻接矩阵表示。V个顶点的值由键盘输入,元素类型为字符型。e条边的信息也由键盘输入。分别调用图的深度优先搜索、广度优先搜索图并输出相应的遍历序列。-Input from the keyboard without the number of vertices to the graph G v and the number of edges e. Establishment of a v vertices, e edges undirected graph consisting of G, with adjacency matrix. V vertex value from keyboard input, the element type of character. e edges of the information is also entered from the keyboard. Call graph, respectively, the depth first search, breadth-first search graph traversal and output the corresponding sequence.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Without the adjlink to map.doc
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.