释义 |
connected graph 连通[接]图;[连接图形] A graph in which there is at least one path joining each pair of vertices, the graph being undirected. It is always possible to travel in a connected graph between onevertex and any other; no vertex is isolated. If a graph is not connected it will consist of several components, each of which is connected; such a graph is said to be disconnected. 一种图中任意两顶点间至少存在一条通路的无向图。 在连通图中,总可以从一个顶点到达另一个任意顶点,没有一个顶点是孤立的。如果一个 图是不连通的,它一定包含若干部分,而这些部分的每一部分是连通的,这种图叫非连通图。 |