Difference between revisions of "Directed Acyclic Graph"
Jump to navigation
Jump to search
(Created page with "{{WikiEntry|key=Directed Acyclic Graph|qCode=1195339}}, a.k.a. DAG, is a directed graph with no directed cycles. It is also a kind of Partially Ordered Set(POSet))...") |
|||
| (One intermediate revision by the same user not shown) | |||
| Line 1: | Line 1: | ||
{{WikiEntry|key=Directed Acyclic Graph|qCode=1195339}}, a.k.a. [[DAG]], is a directed graph with no directed cycles. It is also a kind of [[Partially Ordered Set]]([[POSet]] | {{WikiEntry|key=Directed Acyclic Graph|qCode=1195339}}, a.k.a. [[DAG]], is a directed graph with no directed cycles. It is also a kind of [[Partially Ordered Set]]([[POSet]]). | ||
<noinclude> | <noinclude> | ||
{{PagePostfix | {{PagePostfix | ||
|category_csd=POSet,DAG,Lattice | |category_csd=POSet,DAG,Lattice | ||
}} | |||
</noinclude> | </noinclude> | ||
Latest revision as of 04:46, 4 August 2022
Directed Acyclic Graph(Q1195339), a.k.a. DAG, is a directed graph with no directed cycles. It is also a kind of Partially Ordered Set(POSet).
References
Related Pages