directed acyclic graph

Noun

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

Japanese Meaning

有向非巡回グラフ：有限の頂点と有向の辺から構成され、どの頂点から出発しても一度も同じ頂点に戻る（巡回する）経路が存在しないグラフ。

What is this buttons?

To schedule tasks efficiently, the build system models dependencies using a directed acyclic graph.

Google Translation / DeepL Translation

タスクを効率的にスケジュールするために、ビルドシステムは依存関係を有向非巡回グラフとしてモデル化します。

Details

Sense（1）

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

A subset S of the vertices of a directed acyclic graph is called glb-closed, if it contains the greatest lower bounds of all pairs of vertices of S. […] Directed acyclic graphs are widely used in different areas of computer science.

Google Translation / DeepL Translation

Details

directed acyclic graphs

（ plural ）

Details

directed acyclic graph

Dictionary quizzes to help you remember the meaning

Login / Sign up

Download the app!

directed acyclic graph

Dictionary quizzes to help you remember the meaning

Login / Sign up

Login

──── or ────

Sign up

──── or ────

Download the app!