- 更多网络例句与连接图相关的网络例句 [注：此内容来源于网络，仅供参考]
-
The algorithm is simple and fast as compared with the Boolean algebra algorithm of adjacency matrix .
本文给出一种判断有向连接图中节点是否可达的算法，与一般相邻矩阵的布尔代数算法相比，具有简便快速的优点。
-
One is that we perform Delaunay triangulation instead of using a complete graph in the first step.
第一步骤不作完整图，因为其时间复杂度为O(n2)。本篇论文利用Delaunay triangulation当作一开始的连接图，其时间复杂度为O。
-
This graph is connected.
这个图是连接图。
-
The traditional search algorithm has been improved based on the features of connected graph so that it can calculate operation steps of any specific scheduled task automatically.
针对连接图的这一特点，改进传统的搜索算法，使之可以针对调度任务自动计算操作步骤。
-
Comment: A graph is CONNECTED if there is a path connecting every two vertices.
说明：如果任意两个顶点之间都存在路径相连，那么称这个图为"连接图"
-
And then all directed cutsets from the set of those directed segs were selected by analyzing connectivity of another subgraph.
算法首先利用边收缩图的概念，递归生成有向装配连接图的具有一个连通子图的一部分有向断集，接着通过判断另一个子图是否连通，从这些有向断集的集合中筛选出全部的有向割集。
-
And then all directed cutsets from the set of those directed segs were selected by analyzing connectivity of another subgraph. Theoretical analysis and experimental analysis of the algorithm showed that the improved algorithm was feasible and efficient.
算法首先利用边收缩图的概念，递归生成有向装配连接图的具有一个连通子图的一部分有向断集，接着通过判断另一个子图是否连通，从这些有向断集的集合中筛选出全部的有向割集。
-
According to designs the content to draw the C-SHS production workshopplane, the elevation as well as the dust remover and the air blowerconnection diagram.
根据设计内容画出C-SHS生产车间平面、立面图以及除尘器与风机连接图。
-
This algorithm recursively enumerated a part of DACG directed segs which had one connected subgraph by using the theory of edge contraction.
为解决有向装配图有向割集的求解，给出一个生成有向装配连接图有向割集的高效算法，该算法优先考虑检查有向割集两个子图间边的方向。
-
To resolve directed cutset of Directed Assembly Connection Graph, an efficient algorithm for the enumeration of all directed cutsets of DACG was presented. This algorithm recursively enumerated a part of DACG directed segs which had one connected subgraph by using the theory of edge contraction.
为解决有向装配图有向割集的求解，给出一个生成有向装配连接图有向割集的高效算法，该算法优先考虑检查有向割集两个子图间边的方向。
- 更多网络解释与连接图相关的网络解释 [注：此内容来源于网络，仅供参考]
-
connected domain：连接域
连接有向图 connected digraph | 连接域 connected domain | 连接图 connected graph
-
connected graph：连接图
"conk sheet","软木片" | "connected graph","连接图" | "connecting box","接线箱,分线箱,连接箱"
-
strongly connected graph：强连接图
"强连接组件","strongly connected components" | "强连接图","strongly connected graph" | "强连接有向图","strongly connected of digraph"
-
weakly connected graph：弱连接图
弱连接有向图 weakly connected digraph | 弱连接图 weakly connected graph | 弱型 weakly typed
-
completely connected graph：完全连接图
完成 completed | 完全连接图 completely connected graph | 完全规定函数 completely specified function
-
weaked connected graph：弱连接图
弱堆排序法 weak-heap sort | 弱连接图 weaked connected graph | 最弱充分前提 weakest liberal precondition
-
unilaterally connected graph：单面连接图
单面化 unilateralization | 单面连接图 unilaterally connected graph | 单线,单一线路,单行 uniline
-
cording diagram：连接图, 接线图
Cordilleras | 南美(北美)安地斯山系 | cording diagram | 连接图, 接线图 | cording | 棱纹织物, (如灯心绒)的面
-
hook up drawing：连接图
" "剖视A-A section "A-A" | 连接图 hook up drawing | 比例 scale
-
unconnected graph：非连接图
非受限爆轰速度 unconfined detonation velocity | 非连接图 unconnected graph | 分散的副业 unconsolidated subsidiary