Which of the following is TRUE for a DAG (Directed Acyclic Graph)?
a) Nodes are connected by undirected edges
b) The graph has no directed nor undirected circles
c) The graph could be topologically ordered
d) We could find a path that starts and ends at one equal node