connected undirected graph

基本解釋

Let G be a simple, connected, undirected and finite graph.
本文所考慮的圖均爲(wèi)連通的、有限的無曏簡(jiǎn)單圖。
Broadcast networks can be expressed by a simple connected undirected graph.
將廣播網(wǎng)絡(luò)用簡(jiǎn)單連通的無曏圖表示。
In the cycle packing problem, given an undirected connected graph G, it is required to find the maximum number of pairwise edge disjoint cycles in G.
給定一個(gè)無曏連通圖G ，圈包裝問題就是求G的邊不相交圈的最大數(shù)目。