助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   strong connected 在 计算机软件及计算机应用 分类中 的翻译结果: 查询用时:0.462秒
图标索引 在分类学科中查询
所有学科
计算机软件及计算机应用
数学
宏观经济管理与可持续发展
电信技术
畜牧与动物医学
自动化技术
更多类别查询

图标索引 历史查询
 

strong connected
相关语句
  强连通
    On All The Strong Connected Components of The Directed Graph
    有向图的所有强连通分量
短句来源
    Many documents and papers nowadays have discussed the strong connected component of the directed graph,and the method they adopted is usually Recursion.
    现在有一些文献对有向图的强连通分量做了一些讨论,一般采用了递归的方法。
短句来源
    In activities identification phase,coupled activities was identified by Boolean operation of adjacent matrix,accessible matrix and strong connected matrix.
    在活动识别阶段,通过邻接矩阵、可达矩阵和强连通矩阵,对耦合活动进行识别。
短句来源
    An improved inter-class integration testing sequence algorithm based on extended ORD was developed. Improved Kosaraj distinguish strong connected components was iteratively called to determine SCCs.
    提出了一种基于扩展ORD图的类间集成测试顺序改进算法,通过递归调用改进的Kosaraj鉴别强连通分量的算法来确定SCCs.
短句来源
查询“strong connected”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  strong connected
We only prove the part 2 of this theorem in the case that A be a strong connected Boolean matrix.
      
Soroker states and proves that there is a Hamiltonian cycle in every strong connected tournament.
      


Extend the estimations of the index of primitivity of a nonnegative matrix to aprimitive operator over a polyhedral cone. We introduce the directed graph of K_m-nonnega-tive operator,and discuss the relations among the directed graph,K_m-irreducible operatorand K_M-primitive operator. Our main result is that if A ∈Ⅱ(K_m)is primitive operator,andG(A)is strong connected, hen γ(A)≤(m+s(m-2),where s is the shortest simple circuitin G(A).Thus,the result of dulmage and Mendelsohn is a special case.

继续文献[5]工作,将非负矩阵的素性指标估计推广到多面体锥上的素性算子。通过对多面体锥上非负算子有向图的引入,讨论了多面体锥上非负算子的有向图G(A)与K_m-不可约算子,K_m-素性算子的关系,对非负矩阵素性指标的一些结论进行了推广,主要结果为:若A∈Ⅱ(K_m)为素性算子,且G(A)是强连接的,则对A的素性指标估计有γ(A)≤m+s(m-2),其中s是G(A)中最小简单闭路的长度。这样使得文献[1]中结论成为本文的一个特殊情况。

In this paper the formal model of a backtracking algorithm is discussed, and the mathematical concepts for describing backtracking are presented. The concept of state space is given to describe implicit searching, and the corresponding state spaces of directed graph represented by adjacency table and contiguous list respectively are given to get the result that explicit searching are special cases of implicit searching. The concept of expansive space is presented to depict different data structures corresponding...

In this paper the formal model of a backtracking algorithm is discussed, and the mathematical concepts for describing backtracking are presented. The concept of state space is given to describe implicit searching, and the corresponding state spaces of directed graph represented by adjacency table and contiguous list respectively are given to get the result that explicit searching are special cases of implicit searching. The concept of expansive space is presented to depict different data structures corresponding to different objects of problem solving. Several general backtracking algorithms are given and their applications in various algorithm design problems such as N queens problem, stable marriage problem, node coloring problem, subset-with-given-sum problem, knight's tour problem, longest path problem, and strong-connected component problem, are all discussed. The results help to promote the application of backtracking algorithms with reliability and efficiency.

讨论了回溯算法的形式模型 ,提出了刻画回溯的一些数学概念 ,以隐式搜索为背景提出了状态空间概念 ,给出了分别以邻接方阵和邻接表形式表示的有向图所对应的状态空间 ,从而说明显式搜索是隐式搜索的特例 ,通过展开空间概念揭示了问题求解的不同要求所对应的不同数据结构 ,提出了通用回溯算法 ,并以 N皇后问题、稳定婚姻问题、点着色问题、子集和数问题、跳马问题、最长路径问题和强连通分支问题等多种算法设计问题为例讨论了通用回溯算法的应用 .该文结果有助于扩大回溯算法的使用范围 ,提高回溯算法实现的正确性和效率 .

Many documents and papers nowadays have discussed the strong connected component of the directed graph,and the method they adopted is usually Recursion.This paper,with the graph in an abuttal matrix,seeks all the strong connected components of it with a non-recursion method.

现在有一些文献对有向图的强连通分量做了一些讨论,一般采用了递归的方法。本文利用邻接 矩阵存放有向图,用非递归的方法来求有向图的所有强迫通分量。

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关strong connected的内容
在知识搜索中查有关strong connected的内容
在数字搜索中查有关strong connected的内容
在概念知识元中查有关strong connected的内容
在学术趋势中查有关strong connected的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社