directed acyclic graph

名詞

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

日本語の意味

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

このボタンはなに？

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

Google翻訳 / DeepL翻訳

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

詳細

意味（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翻訳 / DeepL翻訳

詳細

directed acyclic graphs

（ plural ）

詳細

directed acyclic graph

Dictionary quizzes to help you remember the meaning

ログイン / 新規登録

アプリをダウンロード！

directed acyclic graph

Dictionary quizzes to help you remember the meaning

ログイン / 新規登録

ログイン

──── or ────

新規登録

──── or ────

アプリをダウンロード！