Directed Acyclic Graph is a directed graph that does not contain any cycles
- Directed Edges: In Directed Acyclic Graph, each edge has a direction meaning it goes from one node to another. This signifies one way relationship or dependency between nodes
- Acyclic: The term “acyclic” indicates that there are no cycles or closed loops within the graph. In other words you cannot traverse a sequence of directed edges and return to the same node