查看“︁Directed acyclic graph”︁的源代码

==英語==
{{wiki|lang=en}}
[[Image:Topological Ordering.svg|thumb]]

===Noun===
{{en-noun}}

# {{lb|en|graph theory|computer science}} {{w|有向無環圖}}
#: {{syn|en|acyclic digraph|acyclic directed graph|DAG|q3=acronym}}
#: {{hypo|en|Bayesian network|tree}}
#* '''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, {{w|Lecture Notes in Computer Science|LNCS}} 903, [https://books.google.com.au/books?id=mulgp5hb0XkC&pg=PA121&dq=%22directed+acyclic+graph%22%7C%22directed+acyclic+graphs%22&hl=en&sa=X&ved=0ahUKEwiYtYbeg7DdAhVr9YMKHSIPDxwQ6AEISzAJ#v=onepage&q=%22directed%20acyclic%20graph%22%7C%22directed%20acyclic%20graphs%22&f=false 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.
#* '''2001''', Peter J. Pahl, Rudolf Damrath, ''Mathematical Foundations of Computational Engineering: A Handbook'', Springer, [https://books.google.com.au/books?id=kvoaoWOfqd8C&pg=PA574&dq=%22directed+acyclic+graph%22%7C%22directed+acyclic+graphs%22&hl=en&sa=X&ved=0ahUKEwiYtYbeg7DdAhVr9YMKHSIPDxwQ6AEIWzAM#v=onepage&q=%22directed%20acyclic%20graph%22%7C%22directed%20acyclic%20graphs%22&f=false page 574],
#*: In studying these properties, a distinction is made between '''directed acyclic graphs''' with directed edges and simple acyclic graphs with undirected edges.{{...}}A '''directed acyclic graph''' <math>G = (V ; R)</math> is asymmetric and does not contain cycles.
#* '''2011''', Michael Donders, Sara Miner More, Pavel Naumov, ''Information Flow on '''Directed Acyclic Graphs''''', Lev D. Beklemishev, Ruy de Queiroz (editors), ''Logic, Language, Information, and Computation: 18th International Workshop, Proceedings'', Springer, {{w|Lecture Notes in Computer Science|LNAI}} 6642, [https://books.google.com.au/books?id=_mxaAkJzbiIC&pg=PA95&dq=%22directed+acyclic+graph%22%7C%22directed+acyclic+graphs%22&hl=en&sa=X&ved=0ahUKEwiYtYbeg7DdAhVr9YMKHSIPDxwQ6AEIaDAO#v=onepage&q=%22directed%20acyclic%20graph%22%7C%22directed%20acyclic%20graphs%22&f=false page 95],
#*: A logical system that describes the properties of this relation for an arbitrary fixed '''directed acyclic graph''' is introduced and proven to be complete and decidable.


===延伸閱讀===
* {{pedia|Bayesian network|lang=en}}
* [http://mathworld.wolfram.com/AcyclicDigraph.html Acyclic Digraph] on {{w|MathWorld|Wolfram MathWorld}}