本文给出既含无向边又含有向边混合单触点开关网络的拓扑分析与综合的直接方法。
This paper gives the direct approaches for topological analysis and synthesis of hybrid single contact switching networks which contain both undirected and directed edges.
黑白旅行商问题(BWTSP)是近年来出现的新NP -难解问题，根据图中边是否对称可以分为无向BWTSP和有向BWTSP两种。
The black and white salesman problem (BWTSP) is a new NP-hard problem, which can be divided into the undirected BWTSP and the directed BWTSP according to the symmetry of edges in graph.
给定一个无向连通图g，圈包装问题就是求g的边不相交圈的最大数目。
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.
本文提出了一个最小地扩充任意无向连通图为r边连通图的有效算法rma。
The paper gives out an effective calculating method RMA, which changes an arbitrary non-directed graph into a R-side connected graph with minimum enhancement.
推导出由特征多项式的系数表示的线图（无重边图）中圈的个数，双向结点对个数，单向结点对个数及简单图中有向三角形个数的计算公式，等等。
The formulae for the number of loops, edges, triangles, pairs of two-way nodes and pairs of one-way nodes are deduced by the coefficients of a characteristic polynomial, so on.
此外，采用一种动态位向量(DBV)的压缩机制对无向图中边的权重进行压缩存储，以有效地提高算法的空间存储效率。
Besides, the compression mechanism of Dynamic Bit Vector (DBV) was used to store the edge weights in undirected graph to improve the spatial storage efficiency of the algorithm.
以偶对的形式输入一个无向简单图的边，建立该图的邻接矩阵，判断图是否连通(A)。
Even on the form to input an undirected graph edge, the establishment of the adjacency matrix to determine whether the connectivity graph (a).
在证书链的搜索算法中，通过对多重边的有向无环图用深度优先和广度优先算法结合实现对证书链的搜索，避免证书图中产生的环形链而导致低搜索效率问题。
Furthermore, an algorithm of certificate chain processing is presented, which searches the DAGs, and a DAG by depth-first-algorithm, and inter-DAGs by breadth-first-algorithm.
在证书链的搜索算法中，通过对多重边的有向无环图用深度优先和广度优先算法结合实现对证书链的搜索，避免证书图中产生的环形链而导致低搜索效率问题。
Furthermore, an algorithm of certificate chain processing is presented, which searches the DAGs, and a DAG by depth-first-algorithm, and inter-DAGs by breadth-first-algorithm.
应用推荐