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

图标索引 历史查询
 

traverse graph
相关语句
  “traverse graph”译为未确定词的双语例句
     The article introduces some methods and processes in editing calculation formula of spur traverse with Excel as well as the generating steps of traverse graph
     介绍了用Excel编辑支导线计算公式的方法和过程,并扼要说明了导线图的生成步骤。
短句来源
     With the method,vertexes of graph are stored in fields and edges are expressed in records. A method to traverse graph and calculate the minimum spanning tree of graph is given.
     在该方法中,图中各顶点信息用字段来存放,图中的边用记录来表示,给出了在该表示方法中对图进行遍历和求解最小生成树的算法。
短句来源
  相似匹配句对
     [s,t]-GRAPH
     [s,t]-图及其Hamilton性
短句来源
     On X'-critical Graph
     边色数临界图
短句来源
     Traverse Parameter Adjustment
     导线间接平差法
短句来源
     3) Proposed and implemented several methods to improve the SD-RT algorithm with the graph traverse algorithm.
     3)基于图的遍历算法,提出和实现了对于SD-RT算法的几种改进方法。
短句来源
     Traverse is Calculated by Database
     用数据库方法计算导线
短句来源
查询“traverse graph”译词为用户自定义的双语例句

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


In applied program of database, usually meet a kind of seeking. In this paper, given a method of denotiny and traversing graph for relation data base, but achieve traversing process with FOXBASE+.

针对在数据库应用程序中经常遇到的一类查询,提出了一种在关系数据库中对图的表示及遍历的方法,并使用FOXBASE+实现遍历过程。

This paper discusses the application of adjacency matrix at the algorithm's analysis for traversing Graph, Minimum cost Spanning Tree, Topological sort and Critical Path.

对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。

In allusion to a kind of query and the solution of factual problems which usually arise in database application programs the artide,gives a method to denote and calculate graph in relational database. With the method,vertexes of graph are stored in fields and edges are expressed in records. A method to traverse graph and calculate the minimum spanning tree of graph is given. An example to traverse and calculate the minimum spanning tree of a graph without direction is given. The example...

In allusion to a kind of query and the solution of factual problems which usually arise in database application programs the artide,gives a method to denote and calculate graph in relational database. With the method,vertexes of graph are stored in fields and edges are expressed in records. A method to traverse graph and calculate the minimum spanning tree of graph is given. An example to traverse and calculate the minimum spanning tree of a graph without direction is given. The example indicates that it is easy to store data with the method. For the solution to complicated problems in database application, it has reference value..

针对在数据库应用程序中经常遇到的一种查询和实际问题的求解,提出了在关系数据库中对图进行表示和运算的方法。在该方法中,图中各顶点信息用字段来存放,图中的边用记录来表示,给出了在该表示方法中对图进行遍历和求解最小生成树的算法。通过对一无向图的遍历及其最小生成树的求解举例,表明该方法表示图易于存储数据,对于解决数据库应用中遇到的复杂问题具有一定的参考价值。

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

 


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

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