| 词汇 | directed-path |
| 释义 | BETA directed pathcollocation in Englishmeanings of pathThese words are often used together. Click on the links below to explore the meanings. path noun[ C ] uk /pɑːθ/ us /pæθ/ a route or track between one place and another, or the direction in which something ... See more at path Examples of directed pathdirected path However, even the presence of very few rogue edges can prevent a long directedpath. Also, each component has a terminal vertex; that is, a vertex that can be reached from any other vertex in the component by a directedpath. Redei's theorem states that every tournament contains a directedpath visiting each vertex exactly once. The question is whether there is, with positive probability, an infinite directedpath (moving only right and up) starting from (0, 0) and avoiding the blocked points. A vertex "v" is reachable from another vertex "u" if there is a directedpath that starts from "u" and ends at "v". From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. If there is a directedpath from "u" to "v", we say "u" is an ancestor of "v" and "v" is a descendant of "u". From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. For directed graphs, path has to be replaced with "directedpath" and cycle with "directed cycle". From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. A directed graph is strongly connected if it contains a directedpath from every vertex to every other vertex. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. We then show how the search for a rainbow path reduces to a search for a particular collection of directed paths. Two vertices in a directed graph are said to be strongly connected to each other if there is a directedpath from one to the other and vice versa. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. Thus, a traversal stops at the latest at "v" and forms either a directedpath or cycle, beginning with v; we call this path or cycle a "chain". From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. It is connected if it contains a directedpath from "u" to "v" or a directedpath from "v" to "u" for every pair of vertices "u", "v". From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. Because partial orders are by definition antisymmetric, their only directed loops i.e. directed paths which end where they start, are the constant loops. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. It is basically the sum of the directed paths in the network that pass through a particular node. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. Typically, the search algorithm involves expanding nodes by adding all unexpanded neighboring nodes that are connected by directed paths to a priority queue. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. These examples are from corpora and from sources on the web. Any opinions in the examples do not represent the opinion of the Cambridge Dictionary editors or of Cambridge University Press or its licensors. |
反思网英语在线翻译词典收录了377474条英语词汇在线翻译词条，基本涵盖了全部常用英语词汇的中英文双语翻译及用法，是英语学习的有利工具。