English Dictionary

acyclic digraph

名詞

(graph theory, computer science) A directed acyclic graph, a finite directed graph that contains no directed cycles.

日本語の意味

有向非巡回グラフ：グラフ理論や計算機科学で用いられる、有限の有向グラフであって、任意の頂点に戻る有向のサイクル（巡回）が存在しないグラフ。

To schedule tasks with dependencies, the build system models them as an acyclic digraph to avoid circular requirements.

依存関係のあるタスクをスケジュールするため、ビルドシステムは循環的な要件を避けるためにそれらを有向非巡回グラフとしてモデル化します。

意味（1）

(graph theory, computer science) A directed acyclic graph, a finite directed graph that contains no directed cycles.

In the study of the competition graph of an acyclic digraph, there are two fundamental questions which were proposed by Roberts in 1978: One is to characterize the acyclic digraphs that have interval competition graphs and the other is to characterize the graphs which are competition graphs of acyclic digraphs.

acyclic digraphs （ plural ）