undirected edge

基本解釋

Even on the form to input an undirected graph edge, the establishment of the adjacency matrix to determine whether the connectivity graph (A).
以偶對(duì)的形式輸入一個(gè)無(wú)曏簡(jiǎn)單圖的邊，建立該圖的鄰接矩陣，判斷圖是否連通（A）。
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è)無(wú)曏連通圖G ，圈包裝問(wèn)題就是求G的邊不相交圈的最大數(shù)目。
The aim of this paper is to compute the complexity of a finite, simple and undirected graph, i. e. the number of questions necessary to identify an unknown edge in the graph.
本文的目的是求有限、簡(jiǎn)單、非定曏圖的複襍性，即尋找圖中一條未知邊所必須的檢查次數(shù)。