I am reading this link on Wikipedia; it states the following definition is given for a DAG.
Definition: A DAG is a finite, directed graph with no directed cycles.
Reading this definition believes me to think that the digraph below would be a DAG as there are no directed cycles here (there are cycles of the underlying graph but there are no directed cycles).
However, all the pictures on Wikipedia show examples of DAGs with arrows pointing the same way. So, I think I am interpreting this definition wrong. In particular, why does the definition mention later on an equivalent definition is that it must have topological ordering such that "every edge is directed from earlier to later in the sequence"? Reading the definition above would lead me to believe that the graph above is a DAG, but then the equivalent definition would make me think otherwise.