Difference between revisions of "Directed acyclic graph (DAG)"

From wikieduonline
Jump to navigation Jump to search
Line 1: Line 1:
 
[[wikipedia:Directed acyclic graph]] is a directed graph that has no cycles or loops.
 
[[wikipedia:Directed acyclic graph]] is a directed graph that has no cycles or loops.
  
 +
* [[Vertices]]
  
 
== Related ==
 
== Related ==

Revision as of 10:10, 30 November 2022

Advertising: