3 ms·
That's wrong, not all connected DAGs are trees. A DAG is a directed graph that has no (directed) loops. Consider the following: A / \ v v B
by ot 14y ago
That's wrong, not all connected DAGs are trees.
A DAG is a directed graph that has no (directed) loops. Consider the following:
A
/ \
v v
B C
\ /
v v
D
This is a DAG but not a tree, because it has an undirected loop but no directed loops.
- nandemo 14y agoYou're totally right (I had a thinko and managed to miss the D in the DAG). My apologies for the misinformation.