连通图 Connectivity (graph theory)
(重定向自Disconnected graph)
在图论中,连通图基于连通的概念。在一个无向图G中,若从顶点到顶点
有路径相连(当然从
到
也一定有路径),则称
和
是连通的。如果G是有向图,那幺连接
和
的路径中所有的边都必须同向。如果图中任意两点都是连通的,那幺图被称作连通图。图的连通性是图的基本性质。
单词 | Disconnected graph |
释义 |
Disconnected graph
中文百科
连通图 Connectivity (graph theory)(重定向自Disconnected graph)
在图论中,连通图基于连通的概念。在一个无向图G中,若从顶点
英语百科
Connectivity (graph theory) 连通图(重定向自Disconnected graph)
![]() ![]() ![]() ![]() In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) that need to be removed to disconnect the remaining nodes from each other. It is closely related to the theory of network flow problems. The connectivity of a graph is an important measure of its resilience as a network. |
随便看 |
|
英汉网英语在线翻译词典收录了3779314条英语词汇在线翻译词条,基本涵盖了全部常用英语词汇的中英文双语翻译及用法,是英语学习的有利工具。