最終更新日:2022/12/07
正解を見る
(graph theory) A graph in which the edges are ordered pairs, so that, if the edge (a, b) is in the graph, the edge (b, a) need not be in the graph and is distinct from (a, b) if it is.
編集履歴(0)
元となった辞書の項目
directed graph
noun