1) directed cutsets
有向割集
1.
Recursive contraction algorithm for enumerating all directed cutsets of a directional assembly connection graph;
生成有向装配连接图有向割集的递归收缩算法
2) assembly cut-set on directional graph
有向装配割集
1.
Analysis of feasibility of assembly cut-set on directional graph;
有向装配割集可行性分析
3) direct subset
有向子集
4) directed graph set
有向图集
1.
A lower estimation of the Hausdorff dimension for directed graph set with overlaps;
具有重叠结构的有向图集的维数估计
2.
After analysing the advantages and disadvantages of several methods for the recognigtion of fingerprint patterns, this paper put forward a new method for their recognition —the method of directed graph set.
分析了几种指纹自动识别方法的优缺点，提出了一种新的识别方法：有向图集法。
5) directed set
有向集
6) product directed set
积有向集
补充资料：网(有向集)
网(有向集)
net (directed set)
网(有向集)[吐(山n兄扭d滋);ceTI.」 一个有向集(dim曲沮set)到一个(拓扑)空间中的映射.M.H.Bo益uexoacK班益撰[补注】一个空间的拓扑能够完全用收敛性来描述.然而，这需要比序列收敛性概念更一般的收敛性概念.所需要的正是网的收敛(conVe耳笋川沈ofne匕).拓扑空间X中一个网S:D~X收敛到一个点s‘X，如果对、在X中每一个开邻域U，网S最终在U中(c记ntuallyinU).最后的短语是指存在一个m任D，使得对D中所有的n)m，S(”)6U. 网的收敛理论以Moore一51而th收敛(入玉刃祀一Smith田n祀r罗“笼)而闻名({All).
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条