In mathematics and computer science, a directed acyclic graph (DAG), is a finite directed graph with no directed cycles - wikipedia ![]()
# See also - Graph theory * Topic maps * Linked data * Merkle tree
In mathematics and computer science, a directed acyclic graph (DAG), is a finite directed graph with no directed cycles - wikipedia ![]()
# See also - Graph theory * Topic maps * Linked data * Merkle tree