文件名称:50402417
-
所属分类:
- 标签属性:
- 上传时间:2008-10-13
-
文件大小:7.9kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
和树类似,图的遍历是图的一种主要操作,可以通过遍历判别图中任意两个顶点之间是否存在路径、判别给定的图是否是连通图并可求得非连通图的各个连通分量,但对于带权图(网),其最小生成树或最短路径都取决于弧或边上的权值,则需要有特定的算法求解。-and similar trees, graph traversal map is a major operation, Discrimination can traverse map between any two vertices existence trails Discriminant to whether the map graph may seek non - graph the various connectivity components, but with the right plan (net), the minimum spanning tree or shortest path depends on the edge of the arc or the right values, the need for a specific algorithm.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
50402417/ADT.txt
50402417/ds_java/LinearList1.java
50402417/ds_java/Onelink1.class
50402417/ds_java/Onelink1.java
50402417/ds_java/OnelinkNode.class
50402417/ds_java/OnelinkNode.java
50402417/ds_java/Stack1.class
50402417/ds_java/Stack1.java
50402417/ds_java/Stack2.class
50402417/ds_java/Stack2.java
50402417/ds_java/StackInterface.class
50402417/ds_java/StackInterface.java
50402417/ds_java
50402417/Expression1.java
50402417
www.dssz.com.txt
50402417/ds_java/LinearList1.java
50402417/ds_java/Onelink1.class
50402417/ds_java/Onelink1.java
50402417/ds_java/OnelinkNode.class
50402417/ds_java/OnelinkNode.java
50402417/ds_java/Stack1.class
50402417/ds_java/Stack1.java
50402417/ds_java/Stack2.class
50402417/ds_java/Stack2.java
50402417/ds_java/StackInterface.class
50402417/ds_java/StackInterface.java
50402417/ds_java
50402417/Expression1.java
50402417
www.dssz.com.txt
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.