acyclic digraph
acyclic digraph · acyclic digraphs
A directed acyclic graph, a finite directed graph that contains no directed cyclesA directed acyclic graph, a finite directed graph that contains no directed cycles.
/eɪˈsaɪklɪk ˈdaɪɡɹæf/
Значення
значень: 1A directed acyclic graph, a finite directed graph that contains no directed cycles.
Форми
множина: acyclic digraphs| Однина | acyclic digraph |
|---|---|
| Множина | acyclic digraphs |
правильне
Синоніми
синонімів: 2directed graph without cycles:directed acyclic graphacyclic directed graph