dido:public:ra:xapend:xapend.a_glossary:d:directed_acyclic_graph_dag
Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision | |||
|
dido:public:ra:xapend:xapend.a_glossary:d:directed_acyclic_graph_dag [2021/08/11 11:16] murphy |
dido:public:ra:xapend:xapend.a_glossary:d:directed_acyclic_graph_dag [2021/10/04 13:40] (current) 50.19.247.197 ↷ Links adapted because of a move operation |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ===== Directed Acyclic Graph (DAG) ===== | ===== Directed Acyclic Graph (DAG) ===== | ||
| - | [[dido:public:ra:xapend:xapend.a_glossary| Return to Glossary ]] | + | [[dido:public:ra:xapend:xapend.a_glossary:start| Return to Glossary ]] |
| **Directed Acyclic Graph (DAG)** mathematically a DAG is a graph that travels in one direction without cycles connecting the other edges. This means it is impossible to traverse the entire graph starting at one edge. The edges of the directed graph only go one way. The graph is a topological sorting, where each [[dido:public:ra:xapend:xapend.a_glossary:n:node|node]] is in a certain order. | **Directed Acyclic Graph (DAG)** mathematically a DAG is a graph that travels in one direction without cycles connecting the other edges. This means it is impossible to traverse the entire graph starting at one edge. The edges of the directed graph only go one way. The graph is a topological sorting, where each [[dido:public:ra:xapend:xapend.a_glossary:n:node|node]] is in a certain order. | ||
dido/public/ra/xapend/xapend.a_glossary/d/directed_acyclic_graph_dag.1628694975.txt.gz · Last modified: 2021/08/11 11:16 by murphy
