Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01312040n
Noun Concept
Categories: Directed acyclic graphs, Directed graphs
EN
directed acyclic graph  DAG  Weisstein's Conjecture  Weisstein conjecture  acyclic digraph
EN
In mathematics, particularly graph theory, and computer science, a directed acyclic graph is a directed graph with no directed cycles. Wikipedia
Definitions
Relations
Sources
EN
In mathematics, particularly graph theory, and computer science, a directed acyclic graph is a directed graph with no directed cycles. Wikipedia
A directed graph without any directed cycles Wikipedia Disambiguation
Directed graph with no directed cycles Wikidata
A finite directed graph that contains no directed cycles. Wiktionary
Directed graph without cycles. Wiktionary (translation)
IS A
directed graph
simple graph
HAS KIND
polytree
propositional directed acyclic graph
technology tree
connective acyclic graph
DIFFERENT FROM
forest
FR
graphe acyclique
STUDIED BY
graph theory
USED BY
cryptocurrency
IOTA
Wikipedia
EN
directed acyclic graph
Wikidata
EN
directed acyclic graph
Wiktionary
EN
directed acyclic graph
Wikipedia Redirections
EN
Acyclic Digraph, Acyclic digraph, acyclic directed graph, Applications of directed acyclic graphs, DAG (mathematics), DAG structure, Directed Acyclic Graph, Oriented acyclic graph, Weisstein's Conjecture, Weisstein's conjecture, Weisstein conjecture, Weisstein Conjecture
Wikidata Alias
EN
acyclic digraph, acyclic directed graph, DAG, dag, DAG structure

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License