有向路径

词组短语

oriented path

与有向路径相关的网络例句 [注：此内容来源于网络，仅供参考]

A universal algorithm for detecting all simple paths between any two nodes in weighted directed acyclic network was presented.

提出了一种有向无环网络中任意两节点间所有简单路径的通用搜索算法。

The traditional Dijkstra algorithm is based on the nodes relationship of"directed graph"and

传统路径规划常用的Dijkstra 算法是根据道路"有向图"中的节点进行计算，相关的交通属

Finding the shortest path in a directed network is the basic problem in graph theory.

有向图中的最短路径问题是图论应用的基本问题，对很多实际问题很有指导意义。

The symbols, the path and its length of NSP are defined and the properties of NSP are studied. The dissimilitude for shortest path of general net and NSP is indicated, and a loop in the NSP shortest path is allowed. A shortest path algorithm based on NSP is proposed. An example of finding the shortest path is presented.

在定义罚转向网络模型的符号、路径及路径长度的基础上，对所建立的罚转向网络模型的性质进行了讨论，指出了该模型中的最短路径允许具有回路，提出了求解从任一节点到其他有向弧和节点的最短路径的一个算法。

The overcutting on tool end is checked via comparing the tool radius with the circumradius or the radius of inscribed circle, and the touch interference of tool body based on the symbol of the vector distance from the triangle vertex to the tangent plane of tool body column.

在曲面加工的无干涉路径规划中，通过恰当选择刀具初始位置避免了接触点处的曲率干涉；通过比较刀具半径与曲面上三角片外接园半径的大小即可判断刀具底面干涉；而根据三角片顶点与刀杆切平面的有向距离的正负来判断刀杆碰撞干涉。

The former firstly establishes state graph of power system, and then, with the use of the adjacency matrix and path matrix of the directed graph, fast finds out the key transmission sections suffering greatly from the outages of overload lines through simple calculation of matrix.

前者根据实时网络拓扑结构和潮流分布状态，在对初始电力网络简化、分区的基础上，利用有向图的邻接矩阵与路径矩阵，通过简单的矩阵运算，快速识别出与过载线路相关的关键输电断面；后者直接利用系统各支路的阻抗，从图论算法的基本思想出发，搜索最易遭受大负荷转移的关键传输路径，从而将安全性分析目标从整个网络缩小到某些关键的输电线路。

The former firstly establishes state graph of power system, and then, with the use of the adjacency matrix and path matrix of the directed graph, fast finds out the key transmission sections suffered greatly from the outages of overload lines through simple calculation of matrix. In the latter, the minimal short transmission path, the length of which is calculated with line impedance, is determined with graph theory to focus on security analysis objects from the whole network to some key transmission lines.

前者根据实时网络拓扑结构和潮流分布状态，在对初始电力网络简化、分区的基础上，利用有向图的邻接矩阵与路径矩阵，通过简单的矩阵运算，快速识别出与过载线路相关的关键输电断面；后者直接利用系统各支路的阻抗，从图论算法的基本思想出发，搜索最易遭受大负荷转移的关键传输路径，从而将安全性分析目标从整个网络缩小到某些关键的输电线路。

The shortest path problem of dynamic directed networks is significant in the disciplines of transportation and communication systems.

有向网络的最短路问题在交通、通信系统的最优路径计算以及多阶段决策过程的最优轨线设计等实际问题中有着重要应用。

To enhance security in Ad-Hoc networks,it is important to evaluate the trustworthiness of other nodes without centralized authorities.In this work,authors focus on the evaluation of trust evidence in Ad Hoc networks.First,the authors introduce the metrics of the trust,the evaluation process is modeled as a path problem on a directed graph,where nodes represent entities,and edges represent trust relations.Using the theory of semirings,a trust evaluation model based on semiring（TD-SEMIRING） is developed,then two nodes can establish an indirect trust relation without previous direct interaction and introduce the application of this model in route election.At last,the feasibility of this model is analyzed.

讨论了对可信事件的评估：首先介绍了可信的相关概念和相关的特性；接着评估过程被建模成一个在有向图寻找最短路径的问题，在该有向图中结点表示实体或者用户，边表示可信关系，通过使用半环理论，建立了一个基于半环的可信性评估模型TD-SEMIRING，在两个以前没有进行相互操作的实体之间建立间接的可信关系，介绍了这个模型在路由选择当中的应用；最后，通过仿真实验，验证、分析了该模型的有效性。

In order to get out from the cockamamie work in road route design for designers, on the basis of studying the internal relations among local schemes, local scheme was decomposed to small unit logic schemes; the directed network was used to represent the topological connection; the united data structure of point-arc was used to express a network graph. Based on the shortest path theory, the combinatorial optimization algorithm that can search optimal logical schemes of some targets in the network graph intelligently and can form the whole scheme automatically was put forward.

为了使设计者从道路线路设计的繁重计算统计工作中解脱出来，在研究了局部方案间内在关联的基础上，提出了将局部方案分解为更小单位的逻辑方案，用有向网络图表示逻辑方案间的拓扑关系，采用节点－弧段联合数据结构来表示网络图；同时基于最短路径理论，提出了在网络图中智能化搜索综合指标最优的逻辑方案集，自动形成整体方案的组合优化算法。

与有向路径相关的网络解释 [注：此内容来源于网络，仅供参考]

connected component：连通分量

连通分量(connected component): 无向图(undirected graph)中的最大连通子图叫做一个连通分量,例如下图中的连通分量为3强连通分量(strongly connected component): 如果有向图(derected graph)中任意一个节点都存在到达其它每个节点的路径,

connected graph：连通图

节点不重复出现的链称为路径(path);在有向图中,节点不重复出现且链中所有弧的方向一致,则称为有向路径(directed path)无向图中,若任意两点间至少存在一条路径,则称为连通图(connected graph),否则为非连通图( discon-nected graph);

directed path：有向路(径)

次数为 1 的点称为悬挂点(pendant vertex)在无向图中,节点不重复出现的链称为路径(path);在有向图中,节点不重复出现且链中所有弧的方向一致,则称为有向路径(directed path)无向图中,若任意两点间至少存在一条路径,

File Name：文件名称

而不要让miaw自己来关闭. 同样,你可以向舞台(stage)发送命令来关闭它. 在director中有好几种方法可以得到. 下列是常用的四种方法. 注意对话框并不能打开文件,它只是返回文件的完整路径(File Path)和文件名称(File Name).

root：树根

则称为有向路径(directed path)无向图中,若任意两点间至少存在一条路径,则称为连通图(connected graph),否则为非连通图( discon-nected graph);非连通图中的每个连通子图称为成分 (component)树图:倒置的树,根(root)在上,树叶(lea

job scheduling：作业调度

结点3到结点1的有向路径(directed path)长度为3的共有几条(A) 在一个n结点(node)的图,计算单结点到多个结点的最短路径需时间(1) 利用矩阵(matrix)方式,将下图资料,存储起来,请写出其结果.Queue:作业调度(Job Scheduling)及仿真(Simulation).在有限图G中,

simple oriented path：简单的有向路径

simple ore 单矿 | simple oriented path 简单的有向路径 | simple PAL receiver 简单逐行倒相制接收机

undirected graph：无向图

连通分量(connected component): 无向图(undirected graph)中的最大连通子图叫做一个连通分量,例如下图中的连通分量为3强连通分量(strongly connected component): 如果有向图(derected graph)中任意一个节点都存在到达其它每个节点的路径,

Froude number：夫如数

当台风位於台湾2001 年西北行径的桃芝台风(Toraji)在登陆台湾前出现向西的偏折,造南南西象限(地形的下风侧)有一强一弱的转子(gyre)出现,其中较强转子果台风本身因子的改变导致移行路径型态(mode)不同(从向西偏折转为场风速计算出的夫如数(Froude number)不大,则平均流场会