directed acyclic graph

名词 n.
中文释义

英文释义

名词 n.
  1. A finite directed graph that contains no directed cycles.
    — 1995, Volker Turan, Weimin Chen, GLB-closures in Directed Acyclic Graphs and Their Applications, Ernst W. Mayr, Gunther Schmidt, Gottfried Tinhofer (editors), Graph-Theoretic Concepts in Computer Science: 20th International Workshop, Proceedings, Springer, LNCS 903, page 121, 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.

词形变化

directed acyclic graphs plural
0 次浏览 数据来源: Wiktionary