设R为空间X中点的连通关系，每个等价类R[x]称为空间X的一个连通分支。设Y为空间X的非空子集，Y作为X的子空间的连通分支称为X的子集Y的连通分支。
... group box 群组方块 分组框 Connected Components 连通分支 best viable function 最佳可行函式 最佳可行函式 ...
基于1284个网页-相关网页
... 边（Edges） 度和度的分布（Degree & Degree Distribution） 连通分支（Connected component） ...
基于2个网页-相关网页
fuzzy bidirectional associative memories; limit cycles; strongly connected component; period index.
模糊双向联想记忆网络;极限环;强连通分支;周期指数。
参考来源 - 模糊双向联想记忆网络的极限环长度及模糊矩阵周期算法·2,447,543篇论文数据，部分数据来源于NoteExpress
本文假设G为一有限群且G的模特征标度图有两个连通分支。
In this paper, we assume G is a finite group and its modular character degree graph has two connected components.
本文提出一种基于凸性连通分支搜索结合曲线拟合的多椭圆检测算法。
In this paper, a new methodology was proposed based on the connected convex curve searching and ellipse fitting.
从边集合出发给出了计算有向基因组的圈图连通分支的线性时间算法。
An algorithm for computing the connected components of the cycle graph of the given two signed genomes is studied, which is more efficient than the primary algorithm.
应用推荐