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).
以偶对的形式输入一个无向简单图的边，建立该图的邻接矩阵，判断图是否连通（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 ，圈包装问题就是求G的边不相交圈的最大数目。
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.
本文的目的是求有限、简单、非定向图的复杂性，即寻找图中一条未知边所必须的检查次数。