**Frequency: 5/10**
A Directed Acyclic Graph (DAG) is a graph that contains directed edges and does not have any cycles. Topological sorting is an algorithmic process used to order the vertices of a DAG in a linear sequence, where each vertex comes before its successors in the ordering.
This algorithm is pivotal when it comes to problems relating to directed graph.
