助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   strong-connected component 的翻译结果: 查询用时:0.154秒
图标索引 在分类学科中查询
所有学科
数学
更多类别查询

图标索引 历史查询
 

strong-connected component
相关语句
  相似匹配句对
     Number Strong Connected Component and Strong Connectirity's Bound of Circulemt Digraphs
     有向循环图的强连通分支数以及强连通度的界
短句来源
     Number Strong Connected Component and Strong Connectirity's Bound of Circulemt Digraphs
     有向循环图的强连通分支数以及强连通度的界
短句来源
     Every galaxy of * R is a connected component of ( * R, S) ;
     R中的每一个银河是(R,S)的一个连通分支;
短句来源
     The layers are connected by the strong hydrogen bonding.
     在配合物中层与层之间还存在着广泛的氧键,通过氢键相互连接形成三维网状结构。
短句来源
     every Galaxy of R is a connected component of (R, S);
     *R中的每个银河都是(*R,S)的连通分支;
短句来源
查询“strong-connected component”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
没有找到相关例句


In this paper,by using the method of algebra,we discuss some expression about the number strong connected component of circulant digraphs,and get bound of strong connectivity of strong connected circulent digraphs.

本文应用代数方法,讨论了有向循环图的强连通分支数的几种表达,以及强连通的有向循环图的强连通度的界。

In this paper, by using the method of algebra, we discuss some expression about the number strong connected component of circulant digraphs, and get bound of strong connectivity of strong connected circulent digraphs.

本文应用代数方法,讨论了有向循环图的强连通分支数的几种表达,以及强连通的有向循环图的强连通度的界。

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皇后问题、稳定婚姻问题、点着色问题、子集和数问题、跳马问题、最长路径问题和强连通分支问题等多种算法设计问题为例讨论了通用回溯算法的应用 .该文结果有助于扩大回溯算法的使用范围 ,提高回溯算法实现的正确性和效率 .

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

 


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

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