
词语导航
基本信息
词语:有向顶点
繁体:有向頂點
拼音:yǒu xiàng dǐng diǎn
英语翻译
【计】 oriented vertexWWW.wENtiYi.COM
分词翻译
有的英语翻译:
have; add; exist; possess
【法】 possession
向的英语翻译:
always; at; be partial to; direction; face; out; to; toward
【医】 ad-; ak-; ob-
顶点的英语翻译:
height; peak; summit; crown; culmination; meridian; pinnacle; ultimate; zenith
【计】 vertex
【医】 fastigium; max.; maxima; maximum
【经】 ceiling; top-out
翻译例句
1. 计算是结构化的,以有向图的方式进行:程序是图形顶点,而通道则作为图的边。
The computation is structured as a directed graph: programs are graph vertices, while the channels are graph edges.
2. 算法的输入是一个有向图,产生一个图的强连通分量顶点划分。
The algorithm takes a directed graph as input, and produces a partition of the graph"s vertices into the graph"s strongly connected components.
3. 在算法设计与实现中采用一个链接结构的“优先序列”,用它保证有向无回路图顶点的分层拓扑排序。
A "priority queue" which has a linked structure is used in this algorithm, which insures to complete LTP with the vertices in directed acyclic graph.
4. 有向根树就是只有一个顶点的出度为0,其余顶点的出度均为1的有向树。
A directed rooted tree refers to a directed tree which has one vertex with out-degree 0 and all the other vertices with out-degree 1.
5. 若有向图t中任意两个顶点之间恰有一条弧,则称T为竞赛图。
A tournament t is a directed graph in which there is exactly one arc between any two vertices.
6. 若有向图t中任意两个顶点之间恰有一条弧,则称T为竞赛图。
A tournament t is a directed graph in which there is exactly one arc between any two vertices.
版权声明:问题易所有作品(图文、音视频)均来源网络,版权归原创作者所有,与本站立场无关,如不慎侵犯了你的权益,请联系我们告知,我们将做删除处理!
