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...") |
Todd Price (talk | contribs) |
||
| 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. | ||
Revision as of 06:12, 21 April 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.