directed graph with no directed cycles that consists of vertices and edges (also called arcs), with each edge directed from one vertex to another, such that following those directions will never form a closed-loop
directed graph with no directed cycles that consists of vertices and edges (also called arcs), with each edge directed from one vertex to another, such that following those directions will never form a closed-loop