文件名称:UndirectedGraph
-
所属分类：
- 标签属性：
- 上传时间：2013-06-07
-
文件大小：1.31kb
-
已下载：0次
-
提 供 者：
-
相关连接：无下载说明：别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容来自于网络，使用问题请自行百度
遍历一遍，判断图分为几部分（假定为P部分，即图有 P 个连通分量）,对于每一个连通分量，如果无环则只能是树，即：边数＝结点数－1,只要有一个满足边数>结点数－1,原图就有环.
-Traverse again, the determination map is divided into several parts (assumed to section P, with P in Figure connected component), for each connected component, if it can be pierced tree, namely: the number of edges = Junction points-1, as long as There are a number of edges meet> nodes-1, artwork alone ring.
-Traverse again, the determination map is divided into several parts (assumed to section P, with P in Figure connected component), for each connected component, if it can be pierced tree, namely: the number of edges = Junction points-1, as long as There are a number of edges meet> nodes-1, artwork alone ring.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
无向图.txt
1999-2046 搜珍网 All Rights Reserved.
本站作为网络服务提供者，仅为网络服务对象提供信息存储空间，仅对用户上载内容的表现方式做保护处理，对上载内容本身不做任何修改或编辑。