最終更新日：2024/07/28
(graph theory) A directed acyclic graph; an ordered pair (V,E) such that E is a subset of some partial ordering relation on V.
正解を見る
dag
編集履歴（0）
(graph theory) A directed acyclic graph; an ordered pair (V,E) such that E is a subset of some partial ordering relation on V.
dag
DiQt（ディクト）
無料
★★★★★★★★★★
