Difference between revisions of "Draft 138"
Todd Price (talk | contribs) (Created page with "A Directed Acyclic Graph (DAG) is a directed graph with no directed cycles. That is, it consists of vertices connected by lines (edges), with each edge directed from one ver...") |
m (Brendan moved page Directed Acyclic Graph to Draft 138) |
||
| (One intermediate revision by one other user not shown) | |||
| Line 1: | Line 1: | ||
| − | A Directed Acyclic Graph (DAG) is a directed graph with no directed cycles. | + | A Directed Acyclic Graph (DAG) is a directed [[graph]] with no directed cycles. |
That is, it consists of vertices connected by lines (edges), with each edge directed from one vertex to another, such that following those directions will never form a closed loop. | That is, it consists of vertices connected by lines (edges), with each edge directed from one vertex to another, such that following those directions will never form a closed loop. | ||
Latest revision as of 13:19, 20 November 2022
A Directed Acyclic Graph (DAG) is a directed graph with no directed cycles.
That is, it consists of vertices connected by lines (edges), with each edge directed from one vertex to another, such that following those directions will never form a closed loop.